Total ordering algorithms for asynchronous Byzantine systems
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 242-256
- https://doi.org/10.1007/bfb0022151
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Asynchronous Fault-Tolerant Total Ordering AlgorithmsSIAM Journal on Computing, 1993
- The weakest failure detector for solving consensusPublished by Association for Computing Machinery (ACM) ,1992
- Consensus algorithms with one-bit messagesDistributed Computing, 1991
- Consensus with dual failure modesIEEE Transactions on Parallel and Distributed Systems, 1991
- Unreliable failure detectors for asynchronous systems (preliminary version)Published by Association for Computing Machinery (ACM) ,1991
- Asynchronous Byzantine agreement protocolsInformation and Computation, 1987
- Asynchronous consensus and broadcast protocolsJournal of the ACM, 1985
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978