EFFICIENT SCHEMES FOR PARALLEL COMMUNICATION

被引:57
作者
UPFAL, E [1 ]
机构
[1] HEBREW UNIV JERUSALEM,INST MATH & COMP SCI,JERUSALEM,ISRAEL
关键词
D O I
10.1145/828.1892
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:507 / 517
页数:11
相关论文
共 16 条
[1]  
ALELIUNAS R, 1982, 1ST P S PRINC DISTR, P60
[2]  
ANGLUIN D, 1979, J COMP SYST SCI, V12, P155
[3]  
BERGE G, 1973, GRAPHS HYPERGRAPHS
[4]  
BORODIN A, 1982, 14TH P ACM S THEOR C, P338
[5]   A MEASURE OF ASYMPTOTIC EFFICIENCY FOR TESTS OF A HYPOTHESIS BASED ON THE SUM OF OBSERVATIONS [J].
CHERNOFF, H .
ANNALS OF MATHEMATICAL STATISTICS, 1952, 23 (04) :493-507
[6]   ON THE DISTRIBUTION OF THE NUMBER OF SUCCESSES IN INDEPENDENT TRIALS [J].
HOEFFDING, W .
ANNALS OF MATHEMATICAL STATISTICS, 1956, 27 (03) :713-721
[7]  
MASSON GM, 1979, COMPUTER, V18, P32
[8]   THE CUBE-CONNECTED CYCLES - A VERSATILE NETWORK FOR PARALLEL COMPUTATION [J].
PREPARATA, FP ;
VUILLEMIN, J .
COMMUNICATIONS OF THE ACM, 1981, 24 (05) :300-309
[9]  
RABIN MO, 1976, ALGORITHM COMPLEXITY
[10]  
REIF JH, 1983, 15TH P ANN ACM S THE, P10