Simulations and reductions for colorless tasks
From MaRDI portal
Publication:2933802
DOI10.1145/2332432.2332483zbMath1301.68122OpenAlexW1975658854MaRDI QIDQ2933802
Sergio Rajsbaum, Maurice P. Herlihy
Publication date: 5 December 2014
Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2332432.2332483
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Collapsibility of read/write models using discrete Morse theory ⋮ The topology of distributed adversaries ⋮ Power and limits of distributed computing shared memory models ⋮ Unnamed Item ⋮ A simplicial complex model for dynamic epistemic logic to study distributed task computability ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations ⋮ Wait-free solvability of colorless tasks in anonymous shared-memory model
This page was built for publication: Simulations and reductions for colorless tasks
