Distributed election in a circle without a global sense of orientation

References

• Aburdene , M. F. 1982 . Distributed algorithms for extrema‐finding in circular configurations of processors . Proc. IEEE Int. Symp. on Large Scale Systems , : 269 – 271 .
   Google Scholar
• Burns , J. 1980 . A formal model for message passing systems . Tech. Rep , 91 Computer Science Department, Indiana University
   Google Scholar
• Chang , E. J. and Roberts , R. 1979 . An improved algorithm for decentralized extrema‐ finding in circular configurations of processes . Comm. ACM , 22 ( 5 ) : 281 – 283 .
   Web of Science ®Google Scholar
• Dolev , D. , Klawe , M. and Rodeh , M. 1982 . An 0(n logo) unidirectional distributed algorithm for extrema finding in circles . J. of Algorithms , 3 ( 3 ) : 245 – 260 .
   Web of Science ®Google Scholar
• Franklin , W. R. 1982 . On an improved algorithm for decentralized extrema finding in circular configurations of processors . Comm. ACM , 25 ( 5 ) : 336 – 337 .
   Web of Science ®Google Scholar
• Gallager , R. G. 1979 . Finding a leader in a network with 0(e) + 0(nlogn) messages , MIT Internal Memorandum .
   Google Scholar
• Garcia ‐ Molina , H. 1982 . Elections in distributed computing systems . IEEE Trans, on Comp , C-31 ( 1 ) : 48 – 59 .
   Web of Science ®Google Scholar
• Hirschberg , D. S. and Sinclair , J. B. 1980 . Decentralized extrema‐finding in circular configurations of processes . Comm. ACM , 23 ( 11 ) : 627 – 628 .
   Web of Science ®Google Scholar
• Korach , E. , Rotem , D. and Santoro , N. 1981 . “ A probabilistic algorithm for extrema‐finding in a circle of processors ” . In Tech. Rep , University of Waterloo . Department of Computer Science, CS-81-19
   Google Scholar
• Korach , E. , Rotem , D. and Santoro , N. 1982 . Distributed algorithms for ranking the nodes of a network . Proc. 13th S-E Conf. on Combinatorics, Graph Theory and Computing , : 235 – 246 .
   Google Scholar
• Le Lann , G. 1977 . Distributed systems‐toward a formal approach . Proc. IFIP , 77 : 155 – 160 .
   Google Scholar
• Pachl , J. , Korach , E. and Rotem , D. 1982 . A Technique for proving lower‐bounds for distributed election algorithms . Proc. 14th ACM Symp. on Theory of Computing , 77 : 378 – 382 .
   Google Scholar
• Peterson , G. L. 1982 . An 0(nlogw) unidirectional algorithm for the circular extrema problem . TOPLAS , 4 ( 4 ) : 758 – 762 .
   Web of Science ®Google Scholar
• Rotem , D. and Santoro , N. 1982 . On the reducibility of distributed algorithms for circles of processors , 4 ( 4 ) In preparation
   Google Scholar