Sequentially consistent versus linearizable counting networks

DOI10.1145/301308.301342zbMath1321.68088OpenAlexW2041935382MaRDI QIDQ5892118

Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld

Publication date: 11 September 2015

Published in: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (2)

Read-modify-write networks ⋮ Public data structures: counters as a special case.

This page was built for publication: Sequentially consistent versus linearizable counting networks