Time and Communication Complexity of Leader Election in Anonymous Networks

We study the problem of randomized Leader Election in synchronous distributed networks with indistinguishable nodes. We consider algorithms that work on networks of arbitrary topology in two settings, depending on whether the size of the network, i.e., the number of nodes $n$, is known or not. In the former setting, we present a new Leader Election protocol that improves over previous w...