Fast Distributed Agreement
From MaRDI portal
Recommendations
Cited in
(25)- Efficient agreement using fault diagnosis.
- Distributed consensus revisited
- Byzantine-resistant total ordering algorithms.
- Fast Paxos
- A simple Byzantine generals protocol
- Efficient algorithms for anonymous Byzantine agreement
- Player-centric Byzantine agreement
- Authenticated Algorithms for Byzantine Agreement
- Constant-Space Localized Byzantine Consensus
- Distributed agreement in the presence of processor and communication faults
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
- On the impact of link faults on Byzantine agreement
- Money transfer made simple: a specification, a generic algorithm, and its proof
- Fast and simple distributed consensus
- The Impact of RDMA on Agreement
- Fast Byzantine agreement
- Fast fault-tolerant agreement algorithms
- Signature-free communication and agreement in the presence of Byzantine processes
- Total ordering algorithms for asynchronous Byzantine systems
- Distributed CONGEST Algorithms against Mobile Adversaries
- Levels of authentication in distributed agreement
- Asymptotically optimal early termination for dishonest majority broadcast
- Keynote: Time is not a healer: before and after
- Consensus algorithms with one-bit messages
- Invited talk: Resilient distributed algorithms
This page was built for publication: Fast Distributed Agreement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801050)
