Lower bounds for randomized mutual exclusion

DOI10.1145/167088.167139zbMATH Open1310.68092OpenAlexW1988696549MaRDI QIDQ5248482FDOQ5248482

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

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

This page was built for publication: Lower bounds for randomized mutual exclusion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248482)