Randomized loose renaming in o (log log n ) time

DOI10.1145/2484239.2484240zbMATH Open1323.68548OpenAlexW2116579726MaRDI QIDQ5176095

James Aspnes, Philipp Woelfel, George Giakkoupis, Dan Alistarh

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.2484240

zbMATH Keywords

upper boundslower boundsdistributed computingshared memoryrenaming

Mathematics Subject Classification ID

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

Related Items (1)

Upper bound on the complexity of solving hard renaming

This page was built for publication: Randomized loose renaming in o (log log n ) time