On the robustness of Herlihy's hierarchy
From MaRDI portal
Publication:5361374
DOI10.1145/164051.164070zbMath1373.68103OpenAlexW2023572225MaRDI QIDQ5361374
Publication date: 29 September 2017
Published in: Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6098
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (7)
Wait-free computing ⋮ Life beyond set agreement ⋮ On the use of registers in achieving wait-free consensus ⋮ Algebraic topology and concurrency ⋮ A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks ⋮ The power of multiobjects. ⋮ A classification of wait-free loop agreement tasks
This page was built for publication: On the robustness of Herlihy's hierarchy
