Message-optimal protocols for Byzantine Agreement
- 1 March 1993
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 26 (1) , 41-102
- https://doi.org/10.1007/bf01187074
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- On the relationship between the atomic commitment and consensus problemsPublished by Springer Nature ,2006
- The Failure Discovery problemTheory of Computing Systems, 1993
- Early stopping in Byzantine agreementJournal of the ACM, 1990
- Automatically increasing the fault-tolerance of distributed algorithmsJournal of Algorithms, 1990
- Knowledge and common knowledge in a distributed environmentJournal of the ACM, 1990
- Simulating authenticated broadcasts to derive simple fault-tolerant algorithmsDistributed Computing, 1987
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Bounds on information exchange for Byzantine agreementJournal of the ACM, 1985
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980