Abstract
We address the problem of electing a leader in an anonymous, asynchronous network of arbitrary topology. Our algorithms are considerably simpler than known algorithms and have equal or improved communication complexity.
Original language | English |
---|---|
Pages (from-to) | 312-330 |
Number of pages | 19 |
Journal | Information and Computation |
Volume | 113 |
Issue number | 2 |
DOIs | |
State | Published - Sep 1994 |