Atomic snapshots in O(n log n) operations

DOI10.1145/164051.164055zbMath1373.68187DBLPconf/podc/AttiyaR92OpenAlexW1989051339WikidataQ64216176 ScholiaQ64216176MaRDI QIDQ5365156

Ophir Rachman, Hagit Attiya

Publication date: 29 September 2017

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (3)

The time complexity of updating snapshot memories ⋮ Simple atomic snapshots: A linear complexity solution with unbounded time-stamps ⋮ Atomic snapshots using lattice agreement

This page was built for publication: Atomic snapshots in O(n log n) operations