Autor:	Chan, M. Y., Chin, F. Y. L.
Zdroj:	Distributed Computing; March 1988, Vol. 3 Issue: 1 p19-22, 4p
Abstrakt:	An improved version of Afek and Gafni's synchronous algorithm for distributed election in complete networks is given and anO(n) expected message complexity is shown.
Databáze:	Supplemental Index
Externí odkaz:	Zobrazit plný text záznamu Full text from SpringerLink