Nearest Neighbor Search
[Back to full publication list]
Algorithms for nearest neighbor search, including exact and approximate algorithms.
- 2025:[4] Pkd-tree: Parallel kd-tree with Batch Updates
Ziyang Men*, Zheqi Shen*, Yan Gu*, and Yihan Sun*
ACM Special Interest Group on Management of Data (SIGMOD), 2025DOI:10.1145/3709712Software Library:Pkd-tree: Parallel kd-tree [Github]
Poster and oral presentation at the SIAM Conference on Applied and Computational Discrete Algorithms (ACDA), 2025
Poster and oral presentation at the Highlights of Parallel Computing (HOPC@SPAA), 2025
Paper ArXiV Code Slides Poster - 2024:[3] ParlayANN: Scalable and Deterministic Parallel Graph-Based Algorithms for Approximate Nearest Neighbor Search
Magdalen Dobson Manohar, Zheqi Shen*, , Laxman Dhulipala, Yan Gu*, Harsha Simhadri, and Yihan Sun*
ACM Symposium on Principles and Practice of Parallel Programming (PPoPP), 2024DOI:10.1145/3627535.3638475Software Library:ParlayANN: Parallel Graph-Based Algorithms for Approximate Nearest Neighbor Search [Github]
Paper ArXiV Code - 2022:[2] Parallel Cover Trees and Applications
Yan Gu*, Zachary Napier, Yihan Sun*, and Letong Wang*
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2022DOI:10.1145/3490148.3538581
Paper Slides -
[1]
POSTER: The Problem-Based Benchmark Suite (PBBS), V2
Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Magdalen Dobson Manohar, and Yihan Sun*
ACM Symposium on Principles and Practice of Parallel Programming (PPoPP), 2022DOI:10.1145/3503221.3508422Software Library:PBBS: The Problem-Based Benchmark Suite [Github]
Paper Code