A simple constructive computability theorem for wait-free computation
From MaRDI portal
Publication:2817615
DOI10.1145/195058.195144zbMath1344.68031OpenAlexW2059541757MaRDI QIDQ2817615
Nir Shavit, Maurice P. Herlihy
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195144
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) PL-topology (57Q99)
Related Items (5)
Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement ⋮ René Thom and an Anticipated h-Principle ⋮ Algebraic topology and concurrency ⋮ t-Resilient Immediate Snapshot Is Impossible ⋮ A classification of wait-free loop agreement tasks
This page was built for publication: A simple constructive computability theorem for wait-free computation