Fair Leader Election by Randomized Voting
暂无分享,去创建一个
[1] David G. Kirkpatrick,et al. Randomized distributed computing on rings , 1988 .
[2] Gérard Le Lann,et al. Distributed Systems - Towards a Formal Approach , 1977, IFIP Congress.
[3] Daniel S. Hirschberg,et al. Decentralized extrema-finding in circular configurations of processors , 1980, CACM.
[4] Danny Dolev,et al. An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle , 1982, J. Algorithms.
[5] Gary L. Peterson,et al. An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem , 1982, TOPL.
[6] Dana Angluin,et al. Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.
[7] W. Randolph Franklin. On an improved algorithm for decentralized extrema finding in circular configurations of processors , 1982, CACM.
[8] David G. Kirkpatrick,et al. The Bit Complexity of Randomized Leader Election on a Ring , 1989, SIAM J. Comput..
[9] Ernest J. H. Chang,et al. An improved algorithm for decentralized extrema-finding in circular configurations of processes , 1979, CACM.
[10] Alon Itai,et al. Symmetry breaking in distributed networks , 1990, Inf. Comput..
[11] Lisa Higham,et al. SIMPLE RANDOMIZED LEADER ELECTION WITH EXTENSIONS , 1990 .