A SCHEME FOR FAST PARALLEL COMMUNICATION

被引：331
作者：
VALIANT, LG
机构：
来源：
SIAM JOURNAL ON COMPUTING | 1982年 / 11卷 / 02期
关键词：
D O I：
10.1137/0211027
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：350 / 361
页数：12
相关论文
共 12 条
[1]   FAST PROBABILISTIC ALGORITHMS FOR HAMILTONIAN CIRCUITS AND MATCHINGS [J].
ANGLUIN, D ;
VALIANT, LG .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (02) :155-193
[2]  
BENES VE, 1965, MATH THEORY CONNECTI
[3]   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
[4]   ON THE DISTRIBUTION OF THE NUMBER OF SUCCESSES IN INDEPENDENT TRIALS [J].
HOEFFDING, W .
ANNALS OF MATHEMATICAL STATISTICS, 1956, 27 (03) :713-721
[5]   A FAST PARALLEL ALGORITHM FOR ROUTING IN PERMUTATION NETWORKS [J].
LEV, GF ;
PIPPENGER, N ;
VALIANT, LG .
IEEE TRANSACTIONS ON COMPUTERS, 1981, 30 (02) :93-100
[6]  
RABIN MO, 1976, ALGORITHMS COMPLEXIT
[7]  
SIEGEL HJ, 1979, COMPUTER, V12, P57, DOI 10.1109/MC.1979.1658780
[8]  
Solovay R., 1977, SIAM Journal on Computing, V6, P84, DOI 10.1137/0206006
[9]  
VALIANT LG, 1980, 18TH P ALL C COMM CO, P802
[10]  
VALIANT LG, 1981, 13TH P ANN ACM S THE, P263, DOI DOI 10.1145/800076.802479
12