Efficient elections in chordal ring networks
- 1 June 1989
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 4 (1) , 437-446
- https://doi.org/10.1007/bf01553900
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circlePublished by Elsevier ,2004
- Electing a leader in a synchronous ringJournal of the ACM, 1987
- Election in a complete network with a sense of directionInformation Processing Letters, 1986
- Lower Bounds for Distributed Maximum-Finding AlgorithmsJournal of the ACM, 1984
- Sense of direction, topological awareness and communication complexityACM SIGACT News, 1984
- Tight lower and upper bounds for some distributed algorithms for a complete network of processorsPublished by Association for Computing Machinery (ACM) ,1984
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema ProblemACM Transactions on Programming Languages and Systems, 1982
- On an improved algorithm for decentralized extrema finding in circular configurations of processorsCommunications of the ACM, 1982
- Analysis of Chordal Ring NetworkIEEE Transactions on Computers, 1981
- A Combinatorial Problem Related to Multimodule Memory OrganizationsJournal of the ACM, 1974