| 2008 |
| 34 | EE | Sunil Arya,
David M. Mount,
Antoine Vigneron,
Jian Xia:
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces.
ESA 2008: 112-123 |
| 33 | EE | Sunil Arya,
Guilherme Dias da Fonseca,
David M. Mount:
Tradeoffs in Approximate Range Searching Made Simpler.
SIBGRAPI 2008: 237-244 |
| 2007 |
| 32 | EE | Sunil Arya,
Theocharis Malamatos,
David M. Mount:
A simple entropy-based algorithm for planar point location.
ACM Transactions on Algorithms 3(2): (2007) |
| 31 | EE | Sunil Arya,
Theocharis Malamatos,
David M. Mount,
Ka Chun Wong:
Optimal Expected-Case Planar Point Location.
SIAM J. Comput. 37(2): 584-610 (2007) |
| 2006 |
| 30 | EE | Sunil Arya,
Theocharis Malamatos,
David M. Mount:
On the importance of idempotence.
STOC 2006: 564-573 |
| 29 | EE | Sunil Arya,
Theocharis Malamatos,
David M. Mount:
The effect of corners on the complexity of approximate range searching.
Symposium on Computational Geometry 2006: 11-20 |
| 2005 |
| 28 | EE | Sunil Arya,
Theocharis Malamatos,
David M. Mount:
Space-time tradeoffs for approximate spherical range counting.
SODA 2005: 535-544 |
| 2003 |
| 27 | EE | Sunil Arya,
Ho-Yam Addy Fu:
Expected-Case Complexity of Approximate Nearest Neighbor Searching.
SIAM J. Comput. 32(3): 793-815 (2003) |
| 2002 |
| 26 | EE | Sunil Arya,
Theocharis Malamatos:
Linear-size approximate voronoi diagrams.
SODA 2002: 147-155 |
| 25 | EE | Sunil Arya,
Theocharis Malamatos,
David M. Mount:
Space-efficient approximate Voronoi diagrams.
STOC 2002: 721-730 |
| 24 | EE | Sunil Arya:
Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
Inf. Process. Lett. 84(4): 201-206 (2002) |
| 2001 |
| 23 | EE | Sunil Arya,
Theocharis Malamatos,
David M. Mount:
Entropy-preserving cuttings and space-efficient planar point location.
SODA 2001: 256-261 |
| 22 | EE | Sunil Arya,
Theocharis Malamatos,
David M. Mount:
A simple entropy-based algorithm for planar point location.
SODA 2001: 262-268 |
| 21 | | Sunil Arya,
Siu-Wing Cheng,
David M. Mount:
Approximation Algorithm for Multiple-Tool Milling.
Int. J. Comput. Geometry Appl. 11(3): 339-372 (2001) |
| 2000 |
| 20 | | Sunil Arya,
Theocharis Malamatos,
David M. Mount:
Nearly Optimal Expected-Case Planar Point Location.
FOCS 2000: 208-218 |
| 19 | EE | V. S. Anil Kumar,
Sunil Arya,
H. Ramesh:
Hardness of Set Cover with Intersection 1.
ICALP 2000: 624-635 |
| 18 | EE | Sunil Arya,
Ho-Yam Addy Fu:
Expected-case complexity of approximate nearest neighbor searching.
SODA 2000: 379-388 |
| 17 | EE | Sunil Arya,
Siu-Wing Cheng,
David M. Mount,
Ramesh Hariharan:
Efficient Expected-Case Algorithms for Planar Point Location.
SWAT 2000: 353-366 |
| 16 | | Sunil Arya,
David M. Mount:
Approximate range searching.
Comput. Geom. 17(3-4): 135-152 (2000) |
| 1999 |
| 15 | | Sunil Arya,
David M. Mount,
Michiel H. M. Smid:
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions.
Comput. Geom. 13(2): 91-107 (1999) |
| 1998 |
| 14 | EE | Sunil Arya,
Siu-Wing Cheng,
David M. Mount:
Approximation Algorithms for Multiple-Tool Miling.
Symposium on Computational Geometry 1998: 297-306 |
| 13 | EE | Sunil Arya,
H. Ramesh:
A 2.5-Factor Approximation Algorithm for the k-MST Problem.
Inf. Process. Lett. 65(3): 117-118 (1998) |
| 12 | EE | Sunil Arya,
David M. Mount,
Nathan S. Netanyahu,
Ruth Silverman,
Angela Y. Wu:
An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions.
J. ACM 45(6): 891-923 (1998) |
| 1997 |
| 11 | | Sunil Arya,
Michiel H. M. Smid:
Efficient Construction of a Bounded-Degree Spanner with Low Weight.
Algorithmica 17(1): 33-54 (1997) |
| 1996 |
| 10 | EE | Sunil Arya,
David M. Mount,
Onuttom Narayan:
Accounting for Boundary Effects in Nearest-Neighbor Searching.
Discrete & Computational Geometry 16(2): 155-176 (1996) |
| 1995 |
| 9 | EE | Sunil Arya,
Gautam Das,
David M. Mount,
Jeffrey S. Salowe,
Michiel H. M. Smid:
Euclidean spanners: short, thin, and lanky.
STOC 1995: 489-498 |
| 8 | EE | Sunil Arya,
David M. Mount:
Approximate Range Searching.
Symposium on Computational Geometry 1995: 172-181 |
| 7 | EE | Sunil Arya,
David M. Mount,
Onuttom Narayan:
Accounting for Boundary Effects in Nearest Neighbor Searching.
Symposium on Computational Geometry 1995: 336-344 |
| 1994 |
| 6 | | Sunil Arya,
Michiel H. M. Smid:
Efficient Construction of a Bounded Degree Spanner with Low Weight.
ESA 1994: 48-59 |
| 5 | | Sunil Arya,
David M. Mount,
Michiel H. M. Smid:
Randomized and deterministic algorithms for geometric spanners of small diameter
FOCS 1994: 703-712 |
| 4 | | Sunil Arya,
David M. Mount,
Nathan S. Netanyahu,
Ruth Silverman,
Angela Y. Wu:
An Optimal Algorithm for Approximate Nearest Neighbor Searching.
SODA 1994: 573-582 |
| 1993 |
| 3 | | Sunil Arya,
David M. Mount:
Algorithms for Fast Vector Quantizaton.
Data Compression Conference 1993: 381-390 |
| 2 | | Sunil Arya,
David M. Mount:
Approximate Nearest Neighbor Queries in Fixed Dimensions.
SODA 1993: 271-280 |
| 1991 |
| 1 | EE | Sunil Arya,
Daniel DeMenthon,
Peter Meer,
Larry S. Davis:
Textural analysis of range images.
Pattern Recognition Letters 12(10): 619-626 (1991) |