Upper and Lower Bounds on the Space Complexity of Detectable Objects

DOI10.1145/3382734.3405725OpenAlexW3046249440MaRDI QIDQ5855201

Ohad Ben-Baruch, Matan Rusanovsky, Danny Hendler

Publication date: 15 March 2021

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

Full work available at URL: https://arxiv.org/abs/2002.11378

zbMATH Keywords

detectabilityconcurrent objectsnon-volatile memoryrecoverable algorithms

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

The ERA Theorem for Safe Memory Reclamation ⋮ Brief Announcement: Efficient Recoverable Writable-CAS

This page was built for publication: Upper and Lower Bounds on the Space Complexity of Detectable Objects