Symmetry breaking in distributed networks
- 1 September 1990
- journal article
- Published by Elsevier in Information and Computation
- Vol. 88 (1) , 60-87
- https://doi.org/10.1016/0890-5401(90)90004-2
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circlePublished by Elsevier ,2004
- On the existence of symmetric algorithms to find leaders in networks of communicating sequential processesActa Informatica, 1988
- On the bit complexity of distributed computations in a ring with a leaderInformation and Computation, 1987
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema ProblemACM Transactions on Programming Languages and Systems, 1982
- The choice coordination problemActa Informatica, 1982
- On an improved algorithm for decentralized extrema finding in circular configurations of processorsCommunications of the ACM, 1982
- 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
- Concurrent Processes and Their SyntaxJournal of the ACM, 1979