Set consensus using arbitrary objects (preliminary version)

DOI10.1145/197917.198119MaRDI QIDQ5361424zbMATH OpenOpenAlexFDO

Authors Sergio Rajsbaum, Maurice 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)

Cited in

(18)

• A classification of wait-free loop agreement tasks
• Bounded disagreement
• On the computability power and the robustness of set agreement-oriented failure detector classes
• 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
• Schlegel diagram and optimizable immediate snapshot protocol
• The topology of distributed adversaries
• A non-topological proof for the impossibility of \(k\)-set agreement
• The BG distributed simulation algorithm
• Hundreds of impossibility results for distributed computing
• A Sound Foundation for the Topological Approach to Task Solvability
• A topological perspective on distributed network algorithms
• Wait-free computing
• The combinatorial structure of wait-free solvable tasks (extended abstract)
• Defining logical obstruction with fixpoints in epistemic logic
• Preserving hyperproperties of programs using primitives with consensus number 2
• Strong linearizability using primitives with consensus number 2

This page was built for publication: Set consensus using arbitrary objects (preliminary version)

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