On k -set consensus problems in asynchronous systems
From MaRDI portal
Publication:2942769
DOI10.1145/301308.301368zbMath1321.68069OpenAlexW2143018799MaRDI QIDQ2942769
Michael K. Reiter, Roberto De Prisco, Dahlia Malkhi
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
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (6)
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 ⋮ Objects shared by Byzantine processes ⋮ Hundreds of impossibility results for distributed computing ⋮ Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms ⋮ Recent Results on Fault-Tolerant Consensus in Message-Passing Networks
This page was built for publication: On k -set consensus problems in asynchronous systems
