Book Chapter
On the computational power needed to elect a leader
Alon Itai
Lecture Notes in Computer Science, 1991, Volume 486, Distributed Algorithms, Pages 29-40
Book Chapter
A simple, efficient algorithm for maximum finding on rings
Lisa Higham and Teresa Przytycka
Lecture Notes in Computer Science, 1993, Volume 725, Distributed Algorithms, Pages 249-263
Book Chapter
New upperbounds for decentralized extrema-finding in a ring of processors
H. L. Bodlaender and J. van Leeuwen
Lecture Notes in Computer Science, 1986, Volume 210, STACS 86, Pages 119-129
Journal Article
Electing a leader in a ring with link failures
Oded Goldreich and Liuba Shrira
Acta Informatica, 1987, Volume 24, Number 1, Pages 79-91
Book Chapter
Time vs bits
An improved algorithm for leader election in synchronous rings (preliminary version)
Mark Overmars and Nicola Santoro
Lecture Notes in Computer Science, 1989, Volume 349, STACS 89, Pages 282-293
Journal Article
On the message complexity of distributed problems
Nicola Santoro
International Journal of Parallel Programming, 1984, Volume 13, Number 3, Pages 131-147
Book Chapter
Probabilistic leader election on rings of known size
Karl Abrahamson, Andrew Adler, Lisa Higham and David Kirkpatrick
Lecture Notes in Computer Science, 1991, Volume 519, Algorithms and Data Structures, Pages 481-495
Book Chapter
Computations in undistinguished networks
Shaji Bhaskar and Gael N. Buckley
Lecture Notes in Computer Science, 1987, Volume 287, Foundations of Software Technology and Theoretical Computer Science, Pages 124-137
Book Chapter
Leader Election in Anonymous Rings: Franklin Goes Probabilistic
Rena Bakhshi, Wan Fokkink, Jun Pang and Jaco van de Pol
IFIP International Federation for Information Processing, 2008, Volume 273, Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008, Pages 57-72
Book Chapter
Optimal tradeoffs between time and bit complexity in distributed synchronous rings
Bernd Schmeltz
Lecture Notes in Computer Science, 1991, Volume 480, STACS 91, Pages 275-284