Upper and Lower Bounds on the Space Complexity of Detectable Objects-Reference-Cited by-同舟云学术

Upper and Lower Bounds on the Space Complexity of Detectable Objects

Published:2020-07-31 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 39th Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Ben-Baruch Ohad¹,Hendler Danny¹,Rusanovsky Matan¹

Affiliation:

1. Ben-Gurion University

Publisher

ACM

Link

Reference28 articles.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Illusive Failure-Atomic Double-Width Compare-And-Swap;Proceedings of the 2024 Workshop on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems;2024-06-17

2. Brief Announcement: Efficient Recoverable Writable-CAS;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

3. The ERA Theorem for Safe Memory Reclamation;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

4. A Closer Look at Detectable Objects for Persistent Memory;Proceedings of the 2022 Workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems;2022-07-25

5. The performance power of software combining in persistence;Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming;2022-03-28