Improvements in the Time Complexity of Two Message-Optimal Election Algorithms (1985)

by E Gafni
Venue:Proc. 4 th Ann. A CM Symp. on Principles of Distributed Computing