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

by E Gafni
Venue:in Proceedings s of the 4th Symposium on Principles of Distributed Computing (PODC