An improved lower bound for the time complexity of mutual exclusion
From MaRDI portal
Publication:2787670
DOI10.1145/383962.383996zbMath1333.68040MaRDI QIDQ2787670
Yong-Jik Kim, James H. Anderson
Publication date: 4 March 2016
Published in: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/383962.383996
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68M14: Distributed systems
Related Items
Hundreds of impossibility results for distributed computing, A space- and time-efficient local-spin spin lock., Solo-valency and the cost of coordination