Non-blocking interpolation search trees with doubly-logarithmic running time-Reference-Cited by-同舟云学术

Non-blocking interpolation search trees with doubly-logarithmic running time

Published:2020-02-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
language:
Short-container-title:

Author:

Brown Trevor¹,Prokopec Aleksandar²,Alistarh Dan³

Affiliation:

1. University of Waterloo, Canada

2. Oracle Labs, Switzerland

3. Institute of Science and Technology, Austria

Funder

European Research Council

Natural Sciences and Engineering Research Council of Canada

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3332466.3374542

Reference59 articles.

1. 2018. SkipTrie Implementation at GitHub. https://github.com/JoeLeavitt/SkipTrie 2018. SkipTrie Implementation at GitHub. https://github.com/JoeLeavitt/SkipTrie

2. Distributionally Linearizable Data Structures

3. Harnessing epoch-based reclamation for efficient range queries

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

1. A Lock-free Binary Trie;2024 IEEE 44th International Conference on Distributed Computing Systems (ICDCS);2024-07-23

2. Brief Announcement: Lock-free Learned Search Data Structure;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

3. Expediting Hazard Pointers with Bounded RCU Critical Sections;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

4. Wait-free Trees with Asymptotically-Efficient Range Queries;2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2024-05-27

5. Practical Hardware Transactional vEB Trees;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20