Improvements in the time complexity of two message-optimal election algorithms,” in Proceedings of the fourth annual ACM symposium on Principles of distributed computing, PODC '85 (1985)

by E Gafni
Venue:185, ACM