Improvements in the time complexity of two message-optimal election algorithms (1985)

by E Gafni
Venue:Proc. 4th ACM Symp. on Principles of Distributed Computing