Adaptive and efficient abortable mutual exclusion
From MaRDI portal
Publication:2943766
DOI10.1145/872035.872079zbMath1321.68471OpenAlexW2054278856MaRDI QIDQ2943766
Publication date: 4 September 2015
Published in: Proceedings of the twenty-second annual symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/872035.872079
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (5)
Unnamed Item ⋮ Recoverable mutual exclusion with abortability ⋮ A time complexity lower bound for adaptive mutual exclusion ⋮ Randomized mutual exclusion with sub-logarithmic RMR-complexity ⋮ Unnamed Item
Cites Work
This page was built for publication: Adaptive and efficient abortable mutual exclusion
