The bit complexity of randomized leader election on a ring

Authors:
K. Abrahamson;A. Adler;R. Gelbart;L. Higham;D. Kirkpatrick
Affiliations:
Univ. of British Columbia, British Columbia, Canada;Univ. of British Columbia, British Columbia, Canada;Univ. of British Columbia, British Columbia, Canada;Univ. of British Columbia, British Columbia, Canada;Univ. of British Columbia, British Columbia, Canada
Venue:
SIAM Journal on Computing
Year:
1989

Tight lower bounds for probabilistic solitude verification on anonymous rings

Journal of the ACM (JACM)
On randomization in sequential and distributed algorithms

ACM Computing Surveys (CSUR)
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Hundreds of impossibility results for distributed computing

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Fair leader election by randomized voting

ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology

Hi-index	0.00