Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
- 1 March 1993
- journal article
- research article
- Published by Springer Science and Business Media LLC in Theory of Computing Systems
- Vol. 26 (1), 3-19
- https://doi.org/10.1007/bf01187072
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Families of consensus algorithmsPublished by Springer Science and Business Media LLC ,2006
- Early stopping in Byzantine agreementJournal of the ACM, 1990
- Modular construction of nearly optimal Byzantine agreement protocolsPublished by Association for Computing Machinery (ACM) ,1989
- An optimal probabilistic algorithm for synchronous Byzantine agreementLecture Notes in Computer Science, 1989
- Asymptotically optimal distributed consensusPublished by Springer Science and Business Media LLC ,1989
- Towards optimal distributed consensusPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- 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
- Polynomial algorithms for multiple processor agreementPublished by Association for Computing Machinery (ACM) ,1982