Electing a leader in a ring with link failures
- 1 February 1987
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 24 (1) , 79-91
- https://doi.org/10.1007/bf00290707
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
- Elections in the presence of faultsPublished by Association for Computing Machinery (ACM) ,1984
- The impact of synchronous communication on the problem of electing a leader in a ringPublished by Association for Computing Machinery (ACM) ,1984
- Distributed elections in an archimedean ring of processorsPublished by Association for Computing Machinery (ACM) ,1984
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983
- 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
- On describing the behavior and implementation of distributed systemsTheoretical Computer Science, 1981
- Decentralized extrema-finding in circular configurations of processorsCommunications of the ACM, 1980
- An improved algorithm for decentralized extrema-finding in circular configurations of processesCommunications of the ACM, 1979