Bounded cost algorithms for multivalued consensus using binary consensus instances
From MaRDI portal
Publication:989554
DOI10.1016/J.IPL.2009.06.004zbMATH Open1206.68059OpenAlexW2036995187MaRDI QIDQ989554FDOQ989554
Authors: Wei Chen, Jialin Zhang 
Publication date: 20 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.06.004
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
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- Impossibility of distributed consensus with one faulty process
- A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
- Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
Cited In (6)
- Consensus in the presence of mortal Byzantine faulty processes
- Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
- Recent Results on Fault-Tolerant Consensus in Message-Passing Networks
- Extending the wait-free hierarchy to multi-threaded systems
- Self-stabilizing multivalued consensus in asynchronous crash-prone systems
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
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)
