A lower bound for probabilistic distributed algorithms☆
References (23)
- et al.
An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
J. Algorithms
(1982) - et al.
The bit complexity of probabilistic leader election on a unidirectional ring
Local and global properties in networks of processors
- et al.
Computing on an Anonymous Ring
- et al.
New upper bounds for decentralized extrema-finding in a ring of processors
A Formal Model for Message Passing Systems
- et al.
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Comm. Assoc. Comput. Mach.
(1979) On an improved algorithm for decentralized extrema finding in circular configurations of processors
Comm. Assoc. Comput. Mach.
(1982)- et al.
The impact of synchronous communication on the problem of electing a leader in a ring
- et al.
Electing a leader in a synchronous ring
(June 1985)
Election and traversal in unidirectional networks
Cited by (8)
Message terminating algorithms for anonymous rings of unknown size
1995, Information Processing LettersBetter computing on the anonymous ring
1991, Journal of AlgorithmsNew lower bound techniques for distributed leader finding and other problems on rings of processors
1991, Theoretical Computer ScienceHundreds of impossibility results for distributed computing
2003, Distributed ComputingOn Randomization in Sequential and Distributed Algorithms
1994, ACM Computing Surveys (CSUR)Average and randomized complexity of distributed problems
1994, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- ☆
Research supported by the Natural Sciences and Engineering Research Council of Canada.
Copyright © 1987 Published by Elsevier Inc.