| Parlayann: Scalable and deterministic parallel graph-based approximate nearest neighbor search algorithms MD Manohar, Z Shen, G Blelloch, L Dhulipala, Y Gu, HV Simhadri, Y Sun Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and …, 2024 | 19 | 2024 |
| Scaling graph-based anns algorithms to billion-size datasets: A comparative analysis M Dobson, Z Shen, GE Blelloch, L Dhulipala, Y Gu, HV Simhadri, Y Sun arXiv preprint arXiv:2305.04359, 2023 | 17 | 2023 |
| Many sequential iterative algorithms can be parallel and (nearly) work-efficient Z Shen, Z Wan, Y Gu, Y Sun Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022 | 13 | 2022 |
| Parallel Longest Increasing Subsequence and van Emde Boas Trees Y Gu, Z Men, Z Shen, Y Sun, Z Wan Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023 | 9 | 2023 |
| BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers B Wheatman, X Dong, Z Shen, L Dhulipala, J Łącki, P Pandey, H Xu arXiv preprint arXiv:2405.11671, 2024 | 3 | 2024 |
| Parallel kd-tree with Batch Updates Z Men, Z Shen, Y Gu, Y Sun Proceedings of the ACM on Management of Data 3 (1), 1-26, 2025 | | 2025 |
| ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms M Dobson Manohar, Z Shen, GE Blelloch, L Dhulipala, Y Gu, ... arXiv e-prints, arXiv: 2305.04359, 2023 | | 2023 |
| Many Sequential Iterative Algorithms Can Be Parallel and Work-efficient Z Shen, Z Wan, Y Gu, Y Sun | | 2022 |
| Tutorial on Approximate Nearest Neighbor Search (ANNS)–Techniques and Open Problems M Dobson, L Dhulipala, Z Shen, H Vardhan | | |