Better computing on the anonymous ring☆
References (20)
- et al.
Fast probabilistic algorithms for Hamiltonian circuits and matchings
J. Comput. System Sci.
(1979) A lower bound for probabilistic distributed algorithm
J. Algorithms
(1987)N-process synchronization by 4 · log2N-valued shared variable
J. Compt. System Sci.
(1982)- et al.
Randomized function evaluation on a ring
- et al.
Probabilistic Evaluation of Common Function on Rings of Known Size
Local and global properties in networks of processors
- et al.
Computing on the anonymous ring
J. Assoc. Comput. Mach.
(1988) - et al.
Computing on the Anonymous Ring
Distributed Algorithms: Structure and Complexity
A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
Ann. Math. Statist.
(1952)
Cited by (50)
Topology recognition and leader election in colored networks
2016, Theoretical Computer ScienceCitation Excerpt :This justifies the use of this assumption in our algorithms. Many authors [1,3,4,8,17,30,31,39,41,43] studied leader election and other computational problems in anonymous networks. In particular, [7,43] characterize message passing networks in which leader election can be achieved when nodes are anonymous.
Four shades of deterministic leader election in anonymous networks
2023, Distributed ComputingDeterministic Leader Election in Anonymous Radio Networks
2022, ACM Transactions on AlgorithmsFour shades of deterministic leader election in anonymous networks
2021, Annual ACM Symposium on Parallelism in Algorithms and ArchitecturesEnhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election
2020, Journal of the ACM
- ☆
A preliminary version of this paper appeared in “Proceedings, 3rd Aegean Workshop on Computing, Corfu, Greece, June/July 1988” (J. Reif, Ed.), pp. 329–338, Lecture Notes in Computer Science, Vol. 319, Springer-Verlag, New York/Berlin.
- †
Supported by ONR Contract No. N0014-85-K-0168, by NSF Contract No. CCR-8611442, and by DARPA Contract No. N00014-83-K-0125. Part of this work was done while this author was at the Department of Computer Science, Tel-Aviv University, Israel.