Towards optimal distributed election on chordal rings

This publication has 11 references indexed in Scilit:

• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
  Published by Elsevier ,2004
• Efficient elections in chordal ring networks
  Algorithmica, 1989
• Election in a complete network with a sense of direction
  Information Processing Letters, 1986
• Lower Bounds for Distributed Maximum-Finding Algorithms
  Journal of the ACM, 1984
• Sense of direction, topological awareness and communication complexity
  ACM SIGACT News, 1984
• On the message complexity of distributed problems
  International Journal of Parallel Programming, 1984
• Tight lower and upper bounds for some distributed algorithms for a complete network of processors
  Published by Association for Computing Machinery (ACM) ,1984
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
  ACM Transactions on Programming Languages and Systems, 1982
• On an improved algorithm for decentralized extrema finding in circular configurations of processors
  Communications of the ACM, 1982
• Analysis of Chordal Ring Network
  IEEE Transactions on Computers, 1981