Distributed consensus revisited

DOI10.1016/0020-0190(94)90011-6zbMath0795.68082OpenAlexW2065320422MaRDI QIDQ1318741

Gil Neiger

Publication date: 5 April 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90011-6

zbMATH Keywords

distributed computingsynchronous systemsdistributed consensusbyzantine agreementarbitrary failures

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (3)

Hundreds of impossibility results for distributed computing ⋮ Optimistically tuning synchronous Byzantine consensus: another win for null messages ⋮ Recent Results on Fault-Tolerant Consensus in Message-Passing Networks

Cites Work

• Unnamed Item
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• The Byzantine Generals Problem
• Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
• An efficient algorithm for byzantine agreement without authentication

This page was built for publication: Distributed consensus revisited