On the Complexity of Universal Leader Election
Journal of the ACM, Volume 62, Issue 1, 2015.
Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This article focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most “obvious” complexity bounds have...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)