Benjamin Landrum

According to our database, Benjamin Landrum authored at least 4 papers between 2024 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Efficiently Constructing Sparse Navigable Graphs.

Alex Conway, Laxman Dhulipala, Martin Farach-Colton, Rob Johnson, Ben Landrum, Christopher Musco, Yarin Shechter, Torsten Suel, Richard Wen

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Passing the Baton: High Throughput Distributed Disk-Based Vector Search with BatANN.

Nam Anh Dang, Ben Landrum, Ken Birman

CoRR, December, 2025

2024

Results of the Big ANN: NeurIPS'23 competition.

Harsha Vardhan Simhadri, Martin Aumüller, Amir Ingber, Matthijs Douze, George Williams, Magdalen Dobson Manohar, Dmitry Baranchuk, Edo Liberty, Frank Liu, Benjamin Landrum, Mazin Karjikar, Laxman Dhulipala, Meng Chen, Yue Chen, Rui Ma, Kai Zhang, Yuzheng Cai, Jiayang Shi, Yizhuo Chen, Weiguo Zheng, Zihao Wan, Jie Yin, Ben Huang

CoRR, 2024

Approximate Nearest Neighbor Search with Window Filters.

Joshua Engels, Benjamin Landrum, Shangdi Yu, Laxman Dhulipala, Julian Shun

Proceedings of the Forty-first International Conference on Machine Learning, 2024