The Failure Discovery problem

DOI10.1007/BF01187075zbMath0766.68006OpenAlexW2015749979MaRDI QIDQ4031322

Joseph Y. Halpern, Vassos Hadzilacos

Publication date: 1 April 1993

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01187075

zbMATH Keywords

protocoldistributed computingByzantine agreement

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (2)

Message-optimal protocols for Byzantine Agreement ⋮ Optimistically tuning synchronous Byzantine consensus: another win for null messages

Cites Work

• Unnamed Item
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• On the message complexity of binary Byzantine agreement under crash failures
• Knowledge and common knowledge in a distributed environment
• Automatically increasing the fault-tolerance of distributed algorithms
• The Weak Byzantine Generals Problem
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Message-optimal protocols for Byzantine Agreement
• Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
• Are wait-free algorithms fast?
• Unreliable failure detectors for asynchronous systems (preliminary version)
• Using process groups to implement failure detection in asynchronous environments

This page was built for publication: The Failure Discovery problem