Bounded cost algorithms for multivalued consensus using binary consensus instances
From MaRDI portal
Publication:989554
Recommendations
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^{2})\) messages, and constant time
- Error-free multi-valued consensus with Byzantine failures
- Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
Cites work
- A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
- Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- Impossibility of distributed consensus with one faulty process
Cited in
(6)- Recent results on fault-tolerant consensus in message-passing networks
- Consensus in the presence of mortal Byzantine faulty processes
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
- Self-stabilizing multivalued consensus in asynchronous crash-prone systems
- Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
- Extending the wait-free hierarchy to multi-threaded systems
This page was built for publication: Bounded cost algorithms for multivalued consensus using binary consensus instances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989554)
