Sublinear Bounds for Randomized Leader Election

  title={Sublinear Bounds for Randomized Leader Election},
  author={Shay Kutten and Gopal Pandurangan and David Peleg and Peter Robinson and Amitabh Trehan},
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( √ n log n) messages to elect a unique leader (with high probability). When considering the “explicit” variant of leader… CONTINUE READING