k-set agreement with limited accuracy failure detectors
- 16 July 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 143-152
- https://doi.org/10.1145/343477.343536
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Time and message-efficient S-based consensus (brief announcement)Published by Association for Computing Machinery (ACM) ,2000
- Restricted failure detectors: Definition and reduction protocolsInformation Processing Letters, 1999
- A simple and fast asynchronous consensus protocol based on a weak failure detectorDistributed Computing, 1999
- Structured derivations of consensus algorithms for failure detectorsPublished by Association for Computing Machinery (ACM) ,1998
- The weakest failure detector for solving consensusJournal of the ACM, 1996
- Unreliable failure detectors for reliable distributed systemsJournal of the ACM, 1996
- The asynchronous computability theorem for t-resilient tasksPublished by Association for Computing Machinery (ACM) ,1993
- Generalized FLP impossibility result for t-resilient asynchronous computationsPublished by Association for Computing Machinery (ACM) ,1993
- Agreement is harder than consensus: set consensus problems in totally asynchronous systemsPublished by Association for Computing Machinery (ACM) ,1990
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985