Simple constant-time consensus protocols in realistic failure models
From MaRDI portal
Publication:3830798
DOI10.1145/65950.65956zbMath0675.90038OpenAlexW1964052655MaRDI QIDQ3830798
David B. Shmoys, Michael Merritt, Benny Chor
Publication date: 1989
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/65950.65956
Related Items
On the round complexity of randomized Byzantine agreement, Round-optimal Byzantine agreement, A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment, Brief Announcement: Improved Consensus in Quantum Networks, Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication, Transaction commit in a realistic timing model, Hundreds of impossibility results for distributed computing, Sublinear-round Byzantine agreement under corrupt majority, Simultaneity is harder than agreement, Broadcast-optimal two-round MPC
