| 2025 | SODA | Differentiable Approximations for Distance Queries. | Ahmed Abdelkader, David M. Mount |
| 2025 | WADS | Support Vector Machines in the Hilbert Geometry. | Aditya Acharya, Auguste H. Gezalyan, Julian Vanecek, David M. Mount, Sunil Arya |
| 2025 | WADS | Evolving Distributions Under Local Motion. | Aditya Acharya, David M. Mount |
| 2023 | ESA | Smooth Distance Approximation. | Ahmed Abdelkader, David M. Mount |
| 2023 | SODA | Economical Convex Coverings and Applications. | Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
| 2021 | ESA | Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification. | Alejandro Flores-Velazco, David M. Mount |
| 2020 | ESA | Coresets for the Nearest-Neighbor Rule. | Alejandro Flores-Velazco, 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 | ISAAC | Online Algorithms for Warehouse Management. | Philip Dasler, 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 | SIGMOD | Distance Oracle on Terrain Surface. | Victor Junqiu Wei, Raymond Chi-Wing Wong, Cheng Long, David M. Mount |
| 2017 | SODA | Optimal Approximate Polytope Membership. | Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
| 2017 | WADS | Modular Circulation and Applications to Traffic Management. | Philip Dasler, David M. Mount |
| 2016 | SODA | A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees. | Sunil Arya, David M. Mount |
| 2015 | WADS | On the Complexity of an Unregulated Traffic Crossing. | Philip Dasler, David M. Mount |
| 2012 | ESA | A Self-adjusting Data Structure for Multidimensional Point Sets. | Eunhui Park, 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 |
| 2010 | ESA | Spatio-temporal Range Searching over Compressed Kinetic Sensor Data. | Sorelle A. Friedler, David M. Mount |
| 2009 | Algosensors | Compressing Kinetic Data from Sensor Networks. | Sorelle A. Friedler, David M. Mount |
| 2009 | ISAAC | Maintaining Nets and Net Trees under Incremental Motion. | Minkyoung Cho, David M. Mount, Eunhui Park |
| 2008 | ESA | Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. | Sunil Arya, David M. Mount, Antoine Vigneron, Jian Xia |
| 2007 | ICCS | Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets. | Nargess Memarsadeghi, David M. Mount |
| 2006 | ALENEX | Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching. | David M. Mount |
| 2006 | ICASSP | Image Registration and Fusion Studies for the Integration of Multiple Remote Sensing Data. | Jacqueline Le Moigne, Arlene A. Cole-Rhodes, Roger D. Eastman, Peyush Jain, Aimee Joshua, Nargess Memarsadeghi, David M. Mount, Nathan S. Netanyahu, Jeffrey T. Morisette, Ezinne Uko-Ozoro |
| 2006 | IGARSS | Image Fusion Using Cokriging. | Nargess Memarsadeghi, Jacqueline Le Moigne, David M. Mount |
| 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 |
| 2005 | WADS | Improved Approximation Bounds for Planar Point Pattern Matching. | Minkyoung Cho, David M. Mount |
| 2004 | ISAAC | The ABCs of AVDs: Geometric Retrieval Made Simple. | David M. Mount |
| 2003 | ALENEX | Interpolation over Light Fields with Applications in Computer Graphics. | F. Betl Atalay, David M. Mount |
| 2003 | IGARSS | A fast implementation of the ISOCLUS algorithm. | Nargess Memarsadeghi, David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne |
| 2002 | STOC | Space-efficient approximate Voronoi diagrams. | Sunil Arya, Theocharis Malamatos, David M. Mount |
| 2002 | WSCG | Ray Interpolants for Fast Ray-Tracing Reflections and Refractions. | F. Betl Atalay, David M. Mount |
| 2001 | ALENEX | An Empirical Study of a New Approach to Nearest Neighbor Searching. | Songrit Maneewongvatana, David M. Mount |
| 2001 | ICCS | On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions. | Songrit Maneewongvatana, 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 |
| 2001 | SODA | Algorithms for facility location problems with outliers. | Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan |
| 2001 | WADS | The Analysis of a Probabilistic Approach to Nearest Neighbor Searching. | Songrit Maneewongvatana, David M. Mount |
| 2000 | FOCS | Nearly Optimal Expected-Case Planar Point Location. | Sunil Arya, Theocharis Malamatos, David M. Mount |
| 2000 | SODA | A point-placement strategy for conforming Delaunay tetrahedralization. | Michael Murphy, David M. Mount, Carl W. Gable |
| 1999 | ALENEX | Binary Space Partitions in Plcker Space. | David M. Mount, Fan-Tao Pu |
| 1999 | SODA | Computing Nearest Neighbors for Moving Points and Applications to Clustering. | Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu |
| 1997 | SODA | A Practical Approximation Algorithm for the LMS Line Estimator. | David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu |
| 1995 | STOC | Euclidean spanners: short, thin, and lanky. | Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, 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 |
| 1993 | SODA | Efficient Randomized Algorithms for the Repeated Median Line Estimator. | Jir Matousek, David M. Mount, Nathan S. Netanyahu |
| 1993 | WADS | Point Probe Decision Trees for Geometric Concept Classes. | Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko, Steven Skiena |
| 1987 | FOCS | An Output Sensitive Algorithm for Computing Visibility Graphs | Subir Kumar Ghosh, David M. Mount |
| 1982 | STOC | Isomorphism of Graphs with Bounded Eigenvalue Multiplicity | Lszl Babai, D. Yu. Grigoryev, David M. Mount |