Language complexity on the synchronous anonymous ring
Open Access
- 31 December 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 53 (2-3) , 169-185
- https://doi.org/10.1016/0304-3975(87)90062-4
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circlePublished by Elsevier ,2004
- Computing on an anonymous ringPublished by Association for Computing Machinery (ACM) ,1985
- 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