Upper and Lower Bounds on the Space Complexity of Detectable Objects

DOI10.1145/3382734.3405725MaRDI QIDQ5855201zbMATH OpenOpenAlexFDO

Authors Ohad Ben-Baruch, Danny Hendler, Matan Rusanovsky

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 algorithms (68W15) Distributed systems (68M14)

Cited in

(3)

• scientific article; zbMATH DE number 7559135 (Why is no real title available?)
• Brief Announcement: Efficient Recoverable Writable-CAS
• The ERA Theorem for Safe Memory Reclamation

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

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