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 条
[41]   A LOWER-BOUND ON THE PERIOD LENGTH OF A DISTRIBUTED SCHEDULER [J].
MALKA, Y ;
MORAN, S ;
ZAKS, S .
ALGORITHMICA, 1993, 10 (05) :383-398
[42]   Probabilistic model of the algorithms of distributed control protocol in the internet network [J].
O. Yu. Bogoyavlenskaya .
Automation and Remote Control, 2009, 70 :107-117
[43]   Efficient Distributed Approximation Algorithms via Probabilistic Tree Embeddings [J].
Khan, Maleq ;
Kuhn, Fabian ;
Malkhi, Dahlia ;
Pandurangan, Gopal ;
Talwar, Kunal .
PODC'08: PROCEEDINGS OF THE 27TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2008, :263-+
[44]   Efficient distributed approximation algorithms via probabilistic tree embeddings [J].
Khan, Maleq ;
Kuhn, Fabian ;
Malkhi, Dahlia ;
Pandurangan, Gopal ;
Talwar, Kunal .
DISTRIBUTED COMPUTING, 2012, 25 (03) :189-205
[45]   Probabilistic Model of the Algorithms of Distributed Control Protocol in the Internet Network [J].
Bogoyavlenskaya, O. Yu. .
AUTOMATION AND REMOTE CONTROL, 2009, 70 (01) :107-117
[46]   Efficient distributed approximation algorithms via probabilistic tree embeddings [J].
Maleq Khan ;
Fabian Kuhn ;
Dahlia Malkhi ;
Gopal Pandurangan ;
Kunal Talwar .
Distributed Computing, 2012, 25 :189-205
[47]   Two approximation algorithms for probabilistic coalition structure generation with quality bound [J].
Matsumura, Kouki ;
Kodric, Bojana ;
Okimoto, Tenda ;
Hirayama, Katsutoshi .
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2020, 34 (01)
[48]   Two approximation algorithms for probabilistic coalition structure generation with quality bound [J].
Kouki Matsumura ;
Bojana Kodric ;
Tenda Okimoto ;
Katsutoshi Hirayama .
Autonomous Agents and Multi-Agent Systems, 2020, 34
[49]   LOWER BOUNDS FOR DISTRIBUTED MAXIMUM-FINDING ALGORITHMS [J].
PACHL, J ;
KORACH, E ;
ROTEM, D .
JOURNAL OF THE ACM, 1984, 31 (04) :905-918
[50]   Mining Circuit Lower Bound Proofs for Meta-Algorithms [J].
Ruiwen Chen ;
Valentine Kabanets ;
Antonina Kolokolova ;
Ronen Shaltiel ;
David Zuckerman .
computational complexity, 2015, 24 :333-392
12345