Publications¶
This page lists the publications describing ArborX and the algorithms it implements.
If you use ArborX in your work, please cite the library papers below. Their BibTeX entries are available in the CITATION.bib file.
Library¶
Prokopenko, A., Arndt, D., Lebrun-Grandie, D., and Turcksin, B., “The ArborX Library: Version 2.0”. ACM Transactions on Mathematical Software, vol. 51, no. 4, Article 30, pp. 1-10. December 2025
Lebrun-Grandie, D., Prokopenko, A., Turcksin, B., and Slattery, S. R., “ArborX: A Performance Portable Geometric Search Library”. ACM Transactions on Mathematical Software, vol. 47, no. 1, Article 2, pp. 1-15. December 2020
Algorithms¶
Prokopenko, A., Arndt, D., Lebrun-Grandie, D., et al., “Advances in ArborX to support exascale applications”. The International Journal of High Performance Computing Applications, vol. 39, no. 1, pp. 167-176. 2025
Sao, P., Prokopenko, A., and Lebrun-Grandie, D., “PANDORA: A Parallel Dendrogram Construction Algorithm for Single Linkage Clustering on GPU”. In: Proceedings of the 53rd International Conference on Parallel Processing (ICPP ‘24), Association for Computing Machinery, New York, NY, USA, pp. 908-918. 2024
Prokopenko, A. and Lebrun-Grandie, D., “Revising Apetrei’s bounding volume hierarchy construction algorithm to allow stackless traversal”. arXiv:2402.00665 [cs.DS]. 2024
Prokopenko, A., Lebrun-Grandie, D., and Arndt, D., “Fast tree-based algorithms for DBSCAN for low-dimensional data on GPUs”. In: Proceedings of the 52nd International Conference on Parallel Processing (ICPP ‘23), Association for Computing Machinery, New York, NY, USA, pp. 503-512. 2023
Prokopenko, A., Sao, P., and Lebrun-Grandie, D., “A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs”. In: Proceedings of the 51st International Conference on Parallel Processing (ICPP ‘22), Association for Computing Machinery, New York, NY, USA, Article 14, pp. 1-10. 2022