| 2025 | WADS | Support Vector Machines in the Hilbert Geometry. | Aditya Acharya, Auguste H. Gezalyan, Julian Vanecek, David M. Mount, Sunil Arya |
| 2023 | SODA | Economical Convex Coverings and Applications. | Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
| 2020 | SODA | Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. | Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
| 2019 | SODA | Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. | Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
| 2018 | ESA | Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. | Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
| 2017 | SODA | Optimal Approximate Polytope Membership. | Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
| 2016 | SODA | A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees. | Sunil Arya, David M. Mount |
| 2012 | SODA | Polytope approximation and the Mahler volume. | Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
| 2011 | STOC | Approximate polytope membership queries. | Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
| 2010 | ESA | A Unified Approach to Approximate Proximity Searching. | Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
| 2008 | ESA | Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. | Sunil Arya, David M. Mount, Antoine Vigneron, Jian Xia |
| 2006 | STOC | On the importance of idempotence. | Sunil Arya, Theocharis Malamatos, David M. Mount |
| 2005 | SODA | Space-time tradeoffs for approximate spherical range counting. | Sunil Arya, Theocharis Malamatos, David M. Mount |
| 2002 | SODA | Linear-size approximate voronoi diagrams. | Sunil Arya, Theocharis Malamatos |
| 2002 | STOC | Space-efficient approximate Voronoi diagrams. | Sunil Arya, Theocharis Malamatos, David M. Mount |
| 2001 | SODA | Entropy-preserving cuttings and space-efficient planar point location. | Sunil Arya, Theocharis Malamatos, David M. Mount |
| 2001 | SODA | A simple entropy-based algorithm for planar point location. | Sunil Arya, Theocharis Malamatos, David M. Mount |
| 2000 | FOCS | Nearly Optimal Expected-Case Planar Point Location. | Sunil Arya, Theocharis Malamatos, David M. Mount |
| 2000 | ICALP | Hardness of Set Cover with Intersection 1. | V. S. Anil Kumar, Sunil Arya, H. Ramesh |
| 2000 | SODA | Expected-case complexity of approximate nearest neighbor searching. | Sunil Arya, Ho-Yam Addy Fu |
| 1995 | STOC | Euclidean spanners: short, thin, and lanky. | Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid |
| 1994 | ESA | Efficient Construction of a Bounded Degree Spanner with Low Weight. | Sunil Arya, Michiel H. M. Smid |
| 1994 | FOCS | Randomized and deterministic algorithms for geometric spanners of small diameter | Sunil Arya, David M. Mount, Michiel H. M. Smid |
| 1994 | SODA | An Optimal Algorithm for Approximate Nearest Neighbor Searching. | Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu |
| 1993 | DCC | Algorithms for Fast Vector Quantizaton. | Sunil Arya, David M. Mount |
| 1993 | SODA | Approximate Nearest Neighbor Queries in Fixed Dimensions. | Sunil Arya, David M. Mount |