Randomized mutual exclusion in O(log N / log log N) RMRs
From MaRDI portal
Publication:5170298
DOI10.1145/1582716.1582727zbMath1291.68047OpenAlexW1994104555MaRDI QIDQ5170298
Philipp Woelfel, Danny Hendler
Publication date: 23 July 2014
Published in: Proceedings of the 28th ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1582716.1582727
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (1)
This page was built for publication: Randomized mutual exclusion in O(log N / log log N) RMRs
