Author:
Aksenov Vitaly,Kokorin Ilya,Martsenyuk Alena
Publisher
Springer Nature Switzerland
Reference24 articles.
1. Acar, U.A., Blelloch, G.E.: Algorithms: Parallel and sequential. https://www.umut-acar.org/algorithms-book 6 (2019)
2. Akhremtsev, Y., Sanders, P.: Fast parallel operations on search trees. In: 2016 IEEE 23rd International Conference on High Performance Computing (HiPC), pp. 291–300. IEEE (2016)
3. Aksenov, V., Kokorin, I., Martsenyuk, A.: Parallel-batched interpolation search tree. arXiv preprint (2023). arXiv:2306.13785
4. Bentley, J.L., Yao, A.C.C.: An almost optimal algorithm for unbounded searching. Inform. Process. Lett. 5(3), 82–87(SLAC-PUB-1679) (1976)
5. Blelloch, G.E., Ferizovic, D., Sun, Y.: Just join for parallel ordered sets. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 253–264 (2016)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Wait-free Trees with Asymptotically-Efficient Range Queries;2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2024-05-27