Lower bounds for randomized mutual exclusion

DOI10.1145/167088.167139zbMath1310.68092OpenAlexW1988696549MaRDI QIDQ5248482

Eyal Kushilevitz, Yishay Mansour, David Zuckerman, Michael O. Rabin

Publication date: 7 May 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)