The following pages link to Fast Paxos (Q1954195):
Displayed 23 items.
- \textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems (Q433441) (← links)
- Verification of consensus algorithms using satisfiability solving (Q658669) (← links)
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks (Q660994) (← links)
- Generating fast indulgent algorithms (Q693079) (← links)
- Reconfigurable distributed storage for dynamic networks (Q897399) (← links)
- On the coordinator's rule for Fast Paxos (Q963435) (← links)
- On the bit security of cryptographic primitives (Q1648779) (← links)
- Lower bounds for asynchronous consensus (Q1954196) (← links)
- Random walks and concurrent zero-knowledge (Q2229263) (← links)
- Optimistically tuning synchronous Byzantine consensus: another win for null messages (Q2241306) (← links)
- On the correctness of Egalitarian Paxos (Q2294436) (← links)
- The Heard-Of model: computing in distributed systems with benign faults (Q2377130) (← links)
- Automated test case generation for the paxos single-decree protocol using a coloured Petri net model (Q2423754) (← links)
- Generalized Paxos made Byzantine (and less complex) (Q2633262) (← links)
- Recent Results on Fault-Tolerant Consensus in Message-Passing Networks (Q2835019) (← links)
- Byzantizing Paxos by Refinement (Q3095328) (← links)
- piChain: When a Blockchain meets Paxos (Q3300800) (← links)
- How to Solve Consensus in the Smallest Window of Synchrony (Q3540219) (← links)
- Bosco: One-Step Byzantine Asynchronous Consensus (Q3540249) (← links)
- Using Bounded Model Checking to Verify Consensus Algorithms (Q3540251) (← links)
- Protocol combinators for modeling, testing, and execution of distributed systems (Q5018776) (← links)
- (Q5090896) (← links)
- Consensus in Data Management: From Distributed Commit to Blockchain (Q5886006) (← links)