Contention---free complexity of shared memory algorithms

DOI10.1145/197917.197953MaRDI QIDQ5361393zbMATH OpenOpenAlexFDO

Authors Gadi Taubenfeld, Rajeev Alur

Publication date 29 September 2017

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15) Distributed systems (68M14)

This page was built for publication: Contention---free complexity of shared memory algorithms

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