All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust

DOI10.1137/S0097539798335766zbMath0968.68056MaRDI QIDQ4507370

Vassos Hadzilacos, Wai-Kau Lo

Publication date: 18 October 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

robustnesswait-freeconsensus number

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Related Items (6)

Failure detectors as type boosters ⋮ Anomalies and similarities among consensus numbers of variously-relaxed queues ⋮ Hundreds of impossibility results for distributed computing ⋮ The computational structure of progress conditions and shared objects ⋮ A complexity-based classification for multiprocessor synchronization ⋮ A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks

This page was built for publication: All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust