Computing on an anonymous ring
- 1 October 1988
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 35 (4) , 845-875
- https://doi.org/10.1145/48014.48247
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circlePublished by Elsevier ,2004
- Language complexity on the synchronous anonymous ringTheoretical Computer Science, 1987
- Electing a leader in a synchronous ringJournal of the ACM, 1987
- Lower Bounds for Distributed Maximum-Finding AlgorithmsJournal of the ACM, 1984
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema ProblemACM Transactions on Programming Languages and Systems, 1982
- Decentralized extrema-finding in circular configurations of processorsCommunications of the ACM, 1980
- Subword complexities of various classes of deterministic developmental languages without interactionsTheoretical Computer Science, 1975