On k -set consensus problems in asynchronous systems

DOI10.1145/301308.301368MaRDI QIDQ2942769zbMATH OpenOpenAlexFDO

Authors Roberto De Prisco, Dahlia Malkhi, Michael K. Reiter

Publication date 11 September 2015

Published in Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/301308.301368

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Cited in

(8)

• Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
• Recent results on fault-tolerant consensus in message-passing networks
• Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^{2})\) messages, and constant time
• Objects shared by Byzantine processes
• Hundreds of impossibility results for distributed computing
• Tutorial on parameterized model checking of fault-tolerant distributed algorithms
• All Byzantine agreement problems are expensive
• Centroid approximation with multidimensional approximate agreement protocols

This page was built for publication: On k -set consensus problems in asynchronous systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942769)