Sublinear bounds for randomized leader election
Theoretical Computer Science, pp. 134-143, 2015.
This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) uses only O(nlog3/2n) messages to elect a unique leader (with high probability). When considering the “explicit” variant...More
PPT (Upload PPT)