Regular ArticleOptimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings☆
References (17)
- et al.
Better computing on the anonymous ring
J. Algorithms
(1991) - et al.
Two lower bounds in asynchronous distributed computation
J. Comput. Syst. Sci.
(1991) - et al.
Symmetry breaking in distributed networks
Informat. and Comput.
(1990) - et al.
The bit complexity of probabilistic leader election on a undirectional ring
Distributed Algorithms on Graphs
(1986) - et al.
The bit complexity of randomized leader election on a ring
SIAM J. Comput.
(1989) - et al.
Randomized function evaluation on a ring
Distributed Comput.
(1989) - et al.
Probabilistic leader election on rings of known size
Workshop on Algorithms and Data Structures
(1991) - et al.
Tight lower bounds for probabilistic solitude verification on anonymous rings
J. Assoc. Comput. Mach.
(1994)
There are more references available in the full text version of this article.
Cited by (1)
A fast exact quantum algorithm for solitude verification
2017, Quantum Information and Computation
- ☆
This research was supported in part by the Natural Sciences and Engineering Research Council of Canada and the Killam Foundation.
Copyright © 1997 Academic Press. All rights reserved.