Counting networks are practically linearizable

DOI10.1145/248052.248111MaRDI QIDQ2942741zbMATH OpenOpenAlexFDO

Authors Nir Shavit, Dan Touitou, Nancy Lynch, Alexander A. Schwarzmann

Publication date 11 September 2015

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

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Cited in

(1)

• Public data structures: counters as a special case.

This page was built for publication: Counting networks are practically linearizable

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