A LOWER BOUND FOR PROBABILISTIC DISTRIBUTED ALGORITHMS

被引：7

作者：

PACHL, JK ^{[1
]}

机构：

[1] UNIV WATERLOO,DEPT COMP SCI,WATERLOO N2L 3G1,ONTARIO,CANADA

来源：

JOURNAL OF ALGORITHMS | 1987年 / 8卷 / 01期

关键词：

D O I：

10.1016/0196-6774(87)90027-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：53 / 65

页数：13

共 50 条

[1] A LOWER BOUND ON PROBABILISTIC ALGORITHMS FOR DISTRIBUTIVE RING COLORING
NAOR, M
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1991, 4 (03) : 409 - 412
[2] A LOWER BOUND FOR PROBABILISTIC ALGORITHMS FOR FINITE STATE MACHINES
GREENBERG, AG
WEISS, A
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1986, 33 (01) : 88 - 105
[3] A Lower Bound for Distributed Averaging Algorithms on the Line Graph
Olshevsky, Alex
Tsitsiklis, John N.
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2011, 56 (11) : 2694 - 2698
[4] A lower bound for distributed averaging algorithms on the line graph
Olshevsky, Alex
Tsitsiklis, John N.
49TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2010, : 4523 - 4528
[5] PROBABILISTIC ANALYSIS OF SOME DISTRIBUTED ALGORITHMS
LOUCHARD, G
SCHOTT, R
RANDOM STRUCTURES & ALGORITHMS, 1991, 2 (02) : 151 - 186
[6] PROBABILISTIC ANALYSIS OF SOME DISTRIBUTED ALGORITHMS
LOUCHARD, G
SCHOTT, R
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 431 : 239 - 253
[7] LOWER BOUND TECHNIQUES FOR VLSI ALGORITHMS
HROMKOVIC, J
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 281 : 2 - 25
[8] On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms (Extended Abstract)
Fontaine, Allyx
Metivier, Yves
Robson, John Michael
Zemmari, Akka
SOFSEM 2014: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2014, 8327 : 235 - 245
[9] A PROBABILISTIC LOWER BOUND FOR CHECKING DISJOINTNESS OF SETS
MANBER, U
INFORMATION PROCESSING LETTERS, 1984, 19 (01) : 51 - 53
[10] Distributed randomized algorithms for probabilistic performance analysis
Calafiore, Giuseppe Carlo
SYSTEMS & CONTROL LETTERS, 2009, 58 (03) : 202 - 212

← 1 2 3 4 5 →