Tight bounds on the round complexity of distributed 1-solvable tasks
- 10 July 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 145 (1-2) , 271-290
- https://doi.org/10.1016/0304-3975(94)00157-e
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A combinatorial characterization of the distributed 1-solvable tasksJournal of Algorithms, 1990
- Renaming in an asynchronous environmentJournal of the ACM, 1990
- Initial failures in distributed computationsInternational Journal of Parallel Programming, 1989
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- Extended impossibility results for asynchronous complete networksInformation Processing Letters, 1987
- On the minimal synchronism needed for distributed consensusJournal of the ACM, 1987
- Reaching approximate agreement in the presence of faultsJournal of the ACM, 1986
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985