The inherent price of indulgence
- 21 July 2002
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Indulgent algorithms (preliminary version)Published by Association for Computing Machinery (ACM) ,2000
- A simple and fast asynchronous consensus protocol based on a weak failure detectorDistributed Computing, 1999
- A simple bivalency proof that t-resilient consensus requires t+1 roundsInformation Processing Letters, 1999
- Round-by-round fault detectors (extended abstract): unifying synchrony and asynchronyPublished by Association for Computing Machinery (ACM) ,1998
- Unreliable failure detectors for reliable distributed systemsJournal of the ACM, 1996
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985