On the space complexity of randomized synchronization

DOI10.1145/164051.164078zbMath1373.68268OpenAlexW1988061589MaRDI QIDQ5361383

Nir Shavit, Faith E. Fich, Maurice P. Herlihy

Publication date: 29 September 2017

Published in: Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (1)

Agreeing within a few writes

This page was built for publication: On the space complexity of randomized synchronization