Selecting a leader in a clique in 0(N log N) messages
P.A. Humblet · 1984
Abstract : This paper presents an extremely simple algorithm for all processors in a completely connected network to agree on a unique leader. It requires O(N log K) messages, where N is the number of processors, and K is the number of processors that independently start the algorithm.