Efficient agreement using fault diagnosis
- 1 December 1993
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 7 (2) , 87-98
- https://doi.org/10.1007/bf02280838
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Modular construction of an efficient 1-bit Byzantine agreement protocolTheory of Computing Systems, 1993
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 roundsTheory of Computing Systems, 1993
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreementInformation and Computation, 1992
- Modular construction of a Byzantine agreement protocol with optimal message bit complexityInformation and Computation, 1992
- Consensus algorithms with one-bit messagesDistributed Computing, 1991
- Early stopping in Byzantine agreementJournal of the ACM, 1990
- Bounds on information exchange for Byzantine agreementJournal of the ACM, 1985
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982
- The Byzantine generals strike againJournal of Algorithms, 1982
- An efficient algorithm for byzantine agreement without authenticationInformation and Control, 1982