Tight bounds for k -set agreement
- 1 September 2000
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 47 (5) , 912-943
- https://doi.org/10.1145/355483.355489
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Algebraic spansMathematical Structures in Computer Science, 2000
- The topological structure of asynchronous computabilityJournal of the ACM, 1999
- More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous SystemsInformation and Computation, 1993
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Knowledge and common knowledge in a Byzantine environment: Crash failuresInformation and Computation, 1990
- Programming simultaneous actions using common knowledgeAlgorithmica, 1988
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982
- The Byzantine generals strike againJournal of Algorithms, 1982
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980