Set consensus using arbitrary objects (preliminary version)

DOI10.1145/197917.198119zbMath1373.68101OpenAlexW2084605047MaRDI QIDQ5361424

Sergio Rajsbaum, Maurice P. Herlihy

Publication date: 29 September 2017

Published in: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items

On the computability power and the robustness of set agreement-oriented failure detector classes, The topology of distributed adversaries, Schlegel Diagram and Optimizable Immediate Snapshot Protocol, Bounded disagreement, A non-topological proof for the impossibility of \(k\)-set agreement, Wait-free computing, The BG distributed simulation algorithm, Hundreds of impossibility results for distributed computing, A Sound Foundation for the Topological Approach to Task Solvability, Algebraic topology and concurrency, Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects, An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems, A topological perspective on distributed network algorithms, A classification of wait-free loop agreement tasks