Upper bound on the complexity of solving hard renaming

DOI10.1145/2484239.2484251zbMath1323.68291OpenAlexW2140342997MaRDI QIDQ5176094

Ami Paz, Hagit Attiya, Armando Castañeda, Maurice P. Herlihy

Publication date: 2 March 2015

Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2484239.2484251

zbMATH Keywords

distributed systemssymmetry breakingshared memorycombinatorial topologyrenamingwait-free computation

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Randomized algorithms (68W20) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (5)

An algorithmic approach to the asynchronous computability theorem ⋮ Structure theory of flip graphs with applications to weak symmetry breaking ⋮ Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes ⋮ Bounds on the Step and Namespace Complexity of Renaming ⋮ All binomial identities are orderable

This page was built for publication: Upper bound on the complexity of solving hard renaming