On the bit complexity of distributed computations in a ring with a leader
- 1 November 1987
- journal article
- Published by Elsevier in Information and Computation
- Vol. 75 (2) , 162-177
- https://doi.org/10.1016/0890-5401(87)90056-3
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circlePublished by Elsevier ,2004
- Computational Complexity of One-Tape Turing Machine ComputationsJournal of the ACM, 1968
- One-tape, off-line Turing machine computationsInformation and Control, 1965