Total ordering algorithms for asynchronous Byzantine systems
From MaRDI portal
Publication:6084560
DOI10.1007/bfb0022151zbMath1524.68030MaRDI QIDQ6084560
P. Michael Melliar-Smith, Louise E. Moser
Publication date: 1 December 2023
Published in: Distributed Algorithms (Search for Journal in Brave)
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Cites Work
- Consensus algorithms with one-bit messages
- Asynchronous byzantine agreement protocols
- Optimal amortized distributed consensus
- Asynchronous Fault-Tolerant Total Ordering Algorithms
- Asynchronous consensus and broadcast protocols
- Impossibility of distributed consensus with one faulty process
- Fast Distributed Agreement
- Reaching Agreement in the Presence of Faults
- Time, clocks, and the ordering of events in a distributed system
- Unreliable failure detectors for asynchronous systems (preliminary version)
- The weakest failure detector for solving consensus
This page was built for publication: Total ordering algorithms for asynchronous Byzantine systems
