The Complexity of Leader Election: A Chasm at Diameter Two
ICDCN'18: PROCEEDINGS OF THE 19TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING, pp. 13:1-13:10, 2018.
Leader election is one of the fundamental problems in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message complexity of leader election in synchronous distributed networks, in particular, in networks of diameter two. Kutten et al. [JACM 2015] showe...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)