Connectivity requirements for Byzantine agreement under restricted types of failures
- 1 June 1987
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 2 (2) , 95-103
- https://doi.org/10.1007/bf01667081
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the relationship between the atomic commitment and consensus problemsPublished by Springer Nature ,2006
- Easy impossibility proofs for distributed consensus problemsDistributed Computing, 1986
- Authenticated Algorithms for Byzantine AgreementSIAM Journal on Computing, 1983
- On the minimal synchronism needed for distributed consensusPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- The Weak Byzantine Generals ProblemJournal of the ACM, 1983
- The consensus problem in unreliable distributed systems (a brief survey)Published by Springer Nature ,1983
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- The Byzantine generals strike againJournal of Algorithms, 1982
- An efficient algorithm for byzantine agreement without authenticationInformation and Control, 1982
- Zur allgemeinen KurventheorieFundamenta Mathematicae, 1927