The Failure Discovery problem
From MaRDI portal
Publication:4031322
DOI10.1007/BF01187075zbMATH Open0766.68006OpenAlexW2015749979MaRDI QIDQ4031322FDOQ4031322
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
Recommendations
Cites Work
- The Weak Byzantine Generals Problem
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- The Byzantine generals strike again
- Are wait-free algorithms fast?
- Knowledge and common knowledge in a distributed environment
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
- Automatically increasing the fault-tolerance of distributed algorithms
- Title not available (Why is that?)
- Unreliable failure detectors for asynchronous systems (preliminary version)
- Message-optimal protocols for Byzantine Agreement
- Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
- On the message complexity of binary Byzantine agreement under crash failures
- Using process groups to implement failure detection in asynchronous environments
Cited In (6)
This page was built for publication: The Failure Discovery problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031322)