A new solution for the Byzantine generals problem
From MaRDI portal
Recommendations
Cited in
(20)- Efficient agreement using fault diagnosis.
- Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register
- Approximate agreement under mobile Byzantine faults
- A simple Byzantine generals protocol
- Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps
- Efficient algorithms for anonymous Byzantine agreement
- A faster P solution for the Byzantine agreement problem
- Reliable synchronization in distributed systems
- A New Solution to Detectable Byzantine Agreement Problem
- Distributed agreement in the presence of processor and communication faults
- The Weak Byzantine Generals Problem
- scientific article; zbMATH DE number 4085017 (Why is no real title available?)
- On Byzantine generals with alternative plans
- On the impact of link faults on Byzantine agreement
- Byzantine agreement with median validity
- Distributed computing in asynchronous networks with byzantine edges
- A new solution for the Byzantine agreement problem
- Asymptotically optimal early termination for dishonest majority broadcast
- Synchronous consensus under hybrid process and link failures
- Tight bound on mobile Byzantine agreement
This page was built for publication: A new solution for the Byzantine generals problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694674)