Consensus algorithms with one-bit messages
- 1 September 1991
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 4 (3) , 105-110
- https://doi.org/10.1007/bf01798957
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Asymptotically optimal distributed consensusPublished by Springer Nature ,1989
- Towards optimal distributed consensusPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Coordinated traversal: (t+1)-round Byzantine agreement in polynomial timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Fast Distributed AgreementSIAM Journal on Computing, 1987
- Shifting gears: changing algorithms on the fly to expedite Byzantine agreementPublished by Association for Computing Machinery (ACM) ,1987
- A communication-efficient canonical form for fault-tolerant distributed protocolsPublished by Association for Computing Machinery (ACM) ,1986
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980