This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abrahamson, Adler, Higham, and Kirkpatrick. Probabilistic solitude verification on a ring. In Proceedings of the Fifth ACM Symposium on Principles of Distributed Computing, August 11–13 1986.
N. Alon, 1989. Private Communication.
D. Angluin. Local and global properties in networks of processes. In Proc. of the 12th Ann. ACM Symp. on Theory of Computing, pages 82–93, May 1980.
Attiya, Snir, and Warmuth. Computing on an anonymous ring. In Proc. of the Fourth ACM Symp. on Principles of Distributed Computing, August 1985.
D. Angluin and L.G. Valiant. Fast probabilistic algorithms for hamiltonian paths and matchings. J. Comp. Syst. Sci., 18:155–193, 1979.
H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Math. Statistics, 23:493–507, 1952.
R. Cole and U. Vishkin. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In Proc. of the 16th Ann. ACM Symp. on Theory of Computing, pages 206–219, May 1986.
T.I. Fenner and A.M. Frieze. On the connectivity of random m-orientable graphs and digraphs. Combinatorica, 2:347–359, 1982.
G. Frederickson and N. Santoro. Breaking symmetry in synchronous networks. In VLSI Algorithms and Architectures, AWOC, pages 82–93, 1986. Lecture Notes in Computer Science, No 227, Spring Verlag.
A. G. Greenberg and R. Ladner. Estimating the multiplicity of conflicts in multiple access channels. In Proc. of the 24th IEEE Annual Symp. on Foundation of Computer Science, pages 384–392, October 1983.
A. Itai and M. Rodeh. The lord of the ring or probabilistic methods for breaking symmetry in distributed networks. In Proc. of the 28th IEEE Annual Symp. on Foundation of Computer Science, pages 150–158, October 1981.
A. Segall. Distributed network protocols. IEEE Trans. on Information Theory, IT-29(1), January 1983.
B. Schieber and M. Snir. Calling names on nameless networks. In Proc. of the ACM Symp. on Principles of Distributed Computing, August 1989. To appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matias, Y., Afek, Y. (1989). Simple and efficient election algorithms for anonymous networks. In: Bermond, JC., Raynal, M. (eds) Distributed Algorithms. WDAG 1989. Lecture Notes in Computer Science, vol 392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51687-5_42
Download citation
DOI: https://doi.org/10.1007/3-540-51687-5_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51687-3
Online ISBN: 978-3-540-46750-2
eBook Packages: Springer Book Archive