Are Shared Objects Composable under an Oblivious Adversary?

DOI10.1145/2933057.2933115zbMath1375.68196OpenAlexW2475512092MaRDI QIDQ5361952

Philipp Woelfel, Oksana Denysyuk

Publication date: 29 September 2017

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

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

zbMATH Keywords

linearizabilityrandomized algorithmsdistributed algorithmsshared memory

Mathematics Subject Classification ID

Randomized algorithms (68W20) Distributed algorithms (68W15)

This page was built for publication: Are Shared Objects Composable under an Oblivious Adversary?