Towards a Theory of Randomized Shared Memory Algorithms

DOI10.1145/3293611.3338838OpenAlexW2963956851WikidataQ130995132 ScholiaQ130995132MaRDI QIDQ5145195FDOQ5145195

Authors: Philipp Woelfel 

Publication date: 20 January 2021

Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

Monte Carlorandomized algorithmsconcurrencyshared memorymutual exclusioncorrectness conditionstrong linearizability

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

This page was built for publication: Towards a Theory of Randomized Shared Memory Algorithms

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