A Layered Analysis of Consensus
- 1 January 2002
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 31 (4) , 989-1021
- https://doi.org/10.1137/s0097539799364006
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- The BG distributed simulation algorithmDistributed Computing, 2001
- Tight bounds for k -set agreementJournal of the ACM, 2000
- A simple bivalency proof that t-resilient consensus requires t+1 roundsInformation Processing Letters, 1999
- Tight bounds on the round complexity of distributed 1-solvable tasksTheoretical Computer Science, 1995
- Sharing memory robustly in message-passing systemsJournal of the ACM, 1995
- Atomic snapshots of shared memoryJournal of the ACM, 1993
- Knowledge and common knowledge in a Byzantine environment: Crash failuresInformation and Computation, 1990
- A combinatorial characterization of the distributed 1-solvable tasksJournal of Algorithms, 1990
- Complexity of network synchronizationJournal of the ACM, 1985
- Authenticated Algorithms for Byzantine AgreementSIAM Journal on Computing, 1983