The Failure Discovery problem
From MaRDI portal
Publication:4031322
Recommendations
Cites work
- scientific article; zbMATH DE number 3819094 (Why is no real title available?)
- Are wait-free algorithms fast?
- Automatically increasing the fault-tolerance of distributed algorithms
- Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
- Knowledge and common knowledge in a distributed environment
- Message-optimal protocols for Byzantine Agreement
- On the message complexity of binary Byzantine agreement under crash failures
- Reaching Agreement in the Presence of Faults
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
- The Byzantine Generals Problem
- The Byzantine generals strike again
- The Weak Byzantine Generals Problem
- Unreliable failure detectors for asynchronous systems (preliminary version)
- Using process groups to implement failure detection in asynchronous environments
Cited in
(6)- Message-optimal protocols for Byzantine Agreement
- Levels of authentication in distributed agreement
- scientific article; zbMATH DE number 2088918 (Why is no real title available?)
- Optimistically tuning synchronous Byzantine consensus: another win for null messages
- scientific article; zbMATH DE number 1836463 (Why is no real title available?)
- The DNF exception problem
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)