| An optimal algorithm for approximate nearest neighbor searching fixed dimensions S Arya, DM Mount, NS Netanyahu, R Silverman, AY Wu Journal of the ACM (JACM) 45 (6), 891-923, 1998 | 3955 | 1998 |
| Approximate nearest neighbor queries in fixed dimensions. S Arya, DM Mount SODA 93, 271-280, 1993 | 655 | 1993 |
| Euclidean spanners: short, thin, and lanky S Arya, G Das, DM Mount, JS Salowe, M Smid Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995 | 272 | 1995 |
| Algorithms for fast vector quantization S Arya, DM Mount [Proceedings] DCC93: Data Compression Conference, 381-390, 1993 | 254 | 1993 |
| FNN: fast nearest neighbor search algorithms and applications A Beygelzimer, S Kakadet, J Langford, S Arya, D Mount, S Li R package version 1 (1), 1-17, 2013 | 200 | 2013 |
| Approximate range searching S Arya, DM Mount Computational Geometry 17 (3-4), 135-152, 2000 | 160 | 2000 |
| Hardness of set cover with intersection 1 VSA Kumar, S Arya, H Ramesh International Colloquium on Automata, Languages, and Programming, 624-635, 2000 | 113 | 2000 |
| Randomized and deterministic algorithms for geometric spanners of small diameter S Arya, DM Mount, M Smid Proceedings 35th Annual Symposium on Foundations of Computer Science, 703-712, 1994 | 113 | 1994 |
| Accounting for boundary effects in nearest neighbor searching S Arya, DM Mount, O Narayan Proceedings of the eleventh annual symposium on computational geometry, 336-344, 1995 | 110 | 1995 |
| Approximate nearest neighbor searching S Arya, DM Mount Proc. 4th Ann. ACMSIAM Symposium on Discrete Algorithms (SODA’93), 271-280, 1993 | 106 | 1993 |
| Space-time tradeoffs for approximate nearest neighbor searching S Arya, T Malamatos, DM Mount Journal of the ACM (JACM) 57 (1), 1-54, 2009 | 103 | 2009 |
| Space-efficient approximate Voronoi diagrams S Arya, T Malamatos, DM Mount Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 102 | 2002 |
| Approximate range searching S Arya, DM Mount Proceedings of the eleventh annual symposium on Computational geometry, 172-181, 1995 | 88 | 1995 |
| Linear-size approximate voronoi diagrams. S Arya, T Malamatos SODA, 147-155, 2002 | 85 | 2002 |
| Efficient construction of a bounded-degree spanner with low weight S Arya, M Smid Algorithmica 17, 33-54, 1997 | 72 | 1997 |
| Nearest neighbor searching and applications. S Arya | 72 | 1996 |
| Density based clustering of applications with noise (DBSCAN) and related algorithms M Hahsler, M Piekenbrock, S Arya, D Mount CRAN, 2019 | 68 | 2019 |
| A 2.5-factor approximation algorithm for the k-MST problem S Arya, H Ramesh Information Processing Letters 65 (3), 117-118, 1998 | 66 | 1998 |
| Dynamic algorithms for geometric spanners of small diameter: Randomized solutions S Arya, DM Mount, M Smid Computational Geometry 13 (2), 91-107, 1999 | 60* | 1999 |
| RANN: fast nearest neighbour search (wraps ANN library) using L2 metric S Arya, D Mount, SE Kemp, G Jefferis R package version 2 (1), 2019 | 56 | 2019 |
