A tight RMR lower bound for randomized mutual exclusion
From MaRDI portal
Publication:5415530
DOI10.1145/2213977.2214066zbMath1286.68022OpenAlexW1973072380MaRDI QIDQ5415530
George Giakkoupis, Philipp Woelfel
Publication date: 13 May 2014
Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2213977.2214066
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Randomized algorithms (68W20)
Related Items (1)
This page was built for publication: A tight RMR lower bound for randomized mutual exclusion
