REARRANGEABLE NETWORKS WITH LIMITED DEPTH

被引:24
作者
PIPPENGER, N [1 ]
YAO, ACC [1 ]
机构
[1] UNIV CALIF BERKELEY,DEPT ELECT ENGN & COMP SCI,BERKELEY,CA 94720
来源
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1982年 / 3卷 / 04期
关键词
D O I
10.1137/0603041
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:411 / 417
页数:7
相关论文
共 5 条
[1]  
DEBRUIJN NG, 1974, NIEUW ARCH WISKUNDE, V22, P94
[2]   A NEW LOWER BOUND FOR THE NUMBER OF SWITCHES IN REARRANGEABLE NETWORKS [J].
PIPPENGER, N .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (02) :164-167
[3]   SHIFTING GRAPHS AND THEIR APPLICATIONS [J].
PIPPENGER, N ;
VALIANT, LG .
JOURNAL OF THE ACM, 1976, 23 (03) :423-432
[4]   REARRANGEABLE AND NON-BLOCKING SWITCHING NETWORKS [J].
PIPPENGER, N .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1978, 17 (02) :145-162
[5]  
VANLINT JH, 1973, NIEUW ARCH WISKUNDE, V21, P179