On the complexity of universal leader election


Electing a leader is a fundamental task in distributed computing. In its <i>implicit</i> version, only the leader must know who is the elected leader. This article focuses on studying the message and time complexity of <i>randomized</i> implicit leader election in synchronous distributed networks. Surprisingly, the most &#8220;obvious&#8221; complexity… (More)
DOI: 10.1145/2699440


2 Figures and Tables


Citations per Year

Citation Velocity: 19

Averaging 19 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.