Agreement is harder than consensus: set consensus problems in totally asynchronous systems
- 1 August 1990
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 311-324
- https://doi.org/10.1145/93385.93431
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processorPublished by Association for Computing Machinery (ACM) ,1988
- Achievable cases in an asynchronous environmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- On the minimal synchronism needed for distributed consensusJournal of the ACM, 1987
- Fault-tolerant decision making in totally asynchronous distributed systemsPublished by Association for Computing Machinery (ACM) ,1987
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- An O(lg n) expected rounds randomized Byzantine generals protocolPublished by Association for Computing Machinery (ACM) ,1985
- Asynchronous Byzantine consensusPublished by Association for Computing Machinery (ACM) ,1984
- Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocolsPublished by Association for Computing Machinery (ACM) ,1983