The Complexity of Renaming

DOI10.1109/FOCS.2011.66zbMath1292.68151OpenAlexW1977697792MaRDI QIDQ5494996

Seth Gilbert, Dan Alistarh, James Aspnes, Rachid Guerraoui

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/focs.2011.66

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Related Items (5)

Unnamed Item ⋮ Tight Bounds for Asynchronous Renaming ⋮ Efficient randomized test-and-set implementations ⋮ Unnamed Item ⋮ Lower Bounds for Restricted-Use Objects

This page was built for publication: The Complexity of Renaming