Journal of the ACM Bibliography
Greg N. Frederickson and Nancy A. Lynch. Electing a
leader in a synchronous ring. Journal of the ACM,
34(1):98-115, January 1987.
[BibTeX entry]
Selected papers that cite this one
- Y. Afek, M. Cohen, and E. Haalman. The bit complexity of the
predecessor problem. Information Processing Letters,
63(2):109-112, 28 July 1997.
- Paola Alimonti, Paola Flocchini, and Nicola Santoro. Finding the extrema
of a distributed multiset. Journal of Parallel and Distributed
Computing, 37(2):123-133, 15 September 1996.
- Nechama Allenberg-Navony, Alon Itai, and Shlomo Moran. Average
and randomized complexity of distributed problems. SIAM
Journal on Computing, 25(6):1254-1267, December 1996.
- Michael J. Fischer, Shlomo Moran, Steven Rudich, and Gadi Taubenfeld. The
wakeup problem. SIAM Journal on Computing,
25(6):1332-1357, December 1996.
- Moni Naor and Larry Stockmeyer. What can be computed
locally? SIAM Journal on Computing, 24(6):1259-1277,
December 1995.
Shortcuts: