A simple model for agreement in distributed systems
- 27 July 2006
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Reaching approximate agreement in the presence of faultsJournal of the ACM, 1986
- Easy impossibility proofs for distributed consensus problemsDistributed Computing, 1986
- A communication-efficient canonical form for fault-tolerant distributed protocolsPublished by Association for Computing Machinery (ACM) ,1986
- Inexact agreementPublished by Association for Computing Machinery (ACM) ,1985
- Authenticated Algorithms for Byzantine AgreementSIAM Journal on Computing, 1983
- The Weak Byzantine Generals ProblemJournal of the ACM, 1983
- Method for distributed transaction commit and recovery using Byzantine Agreement within clusters of processorsPublished by Association for Computing Machinery (ACM) ,1983
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- Lower bounds for algebraic decision treesJournal of Algorithms, 1982
- An efficient algorithm for byzantine agreement without authenticationInformation and Control, 1982