ON THE REARRANGEABILITY OF 2(LOG2N) - 1 STAGE PERMUTATION NETWORKS

被引：0

作者：

LEE, KY

机构：

来源：

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：412 / 425

页数：14

共 17 条

[1]

BENES BE, 1975, BELL SYST TECH J, V54, P421

[2] PERMUTATION GROUPS COMPLEXES + REARRANGEABLE CONNECTING NETWORKS [J].

BENES, VE .

BELL SYSTEM TECHNICAL JOURNAL, 1964, 43 (4P2) :1619-+

[3]

BENES VE, 1965, MATH THEORY CONNECTI

[4] A STUDY OF NON-BLOCKING SWITCHING NETWORKS [J].

CLOS, C .

BELL SYSTEM TECHNICAL JOURNAL, 1953, 32 (02) :406-424

[5]

GIOIA AA, 1970, THEORY NUMBERS

[6] ON PERMUTATION SWITCHING NETWORKS [J].

JOEL, AE .

BELL SYSTEM TECHNICAL JOURNAL, 1968, 47 (05) :813-+

[7]

LAWRIE D, 1976, IEEE T COMPUT, V25, P1145

[8]

LEE KY, 831125 U ILL DEP COM

[9]

LENFANT J, 1978, IEEE T COMPUT, V27, P637, DOI 10.1109/TC.1978.1675164

[10] A FAST PARALLEL ALGORITHM FOR ROUTING IN PERMUTATION NETWORKS [J].

LEV, GF ;

PIPPENGER, N ;

VALIANT, LG .