Author:
Umar Ibrahim,Anshus Otto,Ha Phuong
Publisher
Springer International Publishing
Reference37 articles.
1. Lecture Notes in Computer Science;Y Afek,2012
2. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116–1127 (1988)
3. Andersson, A.: Faster deterministic sorting and searching in linear space. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, FOCS 1996, pp. 135–141, October 1996
4. Arbel, M., Attiya, H.: Concurrent updates with rcu: search tree as an example. In: Proceedings of 2014 ACM Symposium on Principles of Distributed Computing, PODC 2014, pp. 196–205 (2014)
5. Bender, M., Demaine, E.D., Farach-Colton, M.: Cache-oblivious b-trees. SIAM J. Comput. 35, 341 (2005)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Thread-Safe Term Library;Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles;2022
2. A Scalable and Energy-Efficient Concurrent Binary Search Tree With Fatnodes;IEEE Transactions on Sustainable Computing;2020-10-01
3. Efficient Concurrent Search Trees Using Portable Fine-Grained Locality;IEEE Transactions on Parallel and Distributed Systems;2019-07-01
4. Efficient Compute at the Edge: Optimizing Energy Aware Data Structures for Emerging Edge Hardware;2018 International Conference on High Performance Computing & Simulation (HPCS);2018-07
5. ICE: A General and Validated Energy Complexity Model for Multithreaded Algorithms;INT C PAR DISTRIB SY;2016