Sunil Arya

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 24

Top Topics

Approximate Nearest Neighbor

Related Problems

Top Venues

SIAM J. Comput.

Publications

Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Economical Convex Coverings and Applications. SIAM J. Comput. 53 (4) (2024)
Sunil Arya, David M. Mount
Optimal Volume-Sensitive Bounds for Polytope Approximation. CoRR (2023)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Economical Convex Coverings and Applications. CoRR (2023)
Sunil Arya, David M. Mount
Optimal Volume-Sensitive Bounds for Polytope Approximation. SoCG (2023)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Area-Sensitive Bounds for Polytope Approximation. CoRR (2023)
Ahmed Abdelkader, Sunil Arya, Guilherme D. da Fonseca, David M. Mount
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. CoRR (2023)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Economical Convex Coverings and Applications. SODA (2023)
Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. ACM Trans. Algorithms 18 (4) (2022)
Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. SODA (2020)
Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. CoRR (2019)
Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. SODA (2019)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. CoRR (2018)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. ESA (2018)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Polytope Membership Queries. SIAM J. Comput. 47 (1) (2018)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
On the Combinatorial Complexity of Approximating Polytopes. Discret. Comput. Geom. 58 (4) (2017)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Near-Optimal epsilon-Kernel Construction and Related Problems. SoCG (2017)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Near-Optimal ε-Kernel Construction and Related Problems. CoRR (2017)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Approximate Polytope Membership. SODA (2017)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Approximate Polytope Membership. CoRR (2016)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
On the Combinatorial Complexity of Approximating Polytopes. CoRR (2016)
Sunil Arya, David M. Mount
A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees. SODA (2016)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Polytope Membership Queries. CoRR (2016)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
On the Combinatorial Complexity of Approximating Polytopes. SoCG (2016)
Sunil Arya, David M. Mount, Eunhui Park
Approximate Geometric MST Range Queries. SoCG (2015)
Sunil Arya, Timothy M. Chan
Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels. SoCG (2014)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal area-sensitive bounds for polytope approximation. SCG (2012)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Polytope approximation and the Mahler volume. SODA (2012)
Sunil Arya, David M. Mount, Jian Xia
Tight Lower Bounds for Halfspace Range Searching. Discret. Comput. Geom. 47 (4) (2012)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate polytope membership queries. STOC (2011)
Ganna Chornokur, Sunil Arya, Catherine M. Phelan, Richard Tanner, Shekhar Bhansali
Impedance-Based Miniaturized Biosensor for Ultrasensitive and Fast Prostate-Specific Antigen Detection. J. Sensors 2011 (2011)
Sunil Arya, David M. Mount, Jian Xia
Tight lower bounds for halfspace range searching. SCG (2010)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
A Unified Approach to Approximate Proximity Searching. ESA (1) (2010)
Sunil Arya, Theocharis Malamatos, David M. Mount
Space-time tradeoffs for approximate nearest neighbor searching. J. ACM 57 (1) (2009)
Sunil Arya, Theocharis Malamatos, David M. Mount
The Effect of Corners on the Complexity of Approximate Range Searching. Discret. Comput. Geom. 41 (3) (2009)
Sunil Arya, David M. Mount, Antoine Vigneron, Jian Xia
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. ESA (2008)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Tradeoffs in Approximate Range Searching Made Simpler. SIBGRAPI (2008)
Sunil Arya, Theocharis Malamatos, David M. Mount, Ka Chun Wong
Optimal Expected-Case Planar Point Location. SIAM J. Comput. 37 (2) (2007)
Sunil Arya, Theocharis Malamatos, David M. Mount
A simple entropy-based algorithm for planar point location. ACM Trans. Algorithms 3 (2) (2007)
Sunil Arya, Theocharis Malamatos, David M. Mount
The effect of corners on the complexity of approximate range searching. SCG (2006)
Sunil Arya, Theocharis Malamatos, David M. Mount
On the importance of idempotence. STOC (2006)
Sunil Arya, Theocharis Malamatos, David M. Mount
Space-time tradeoffs for approximate spherical range counting. SODA (2005)
Sunil Arya, Ho-Yam Addy Fu
Expected-Case Complexity of Approximate Nearest Neighbor Searching. SIAM J. Comput. 32 (3) (2003)
Sunil Arya, Theocharis Malamatos
Linear-size approximate voronoi diagrams. SODA (2002)
Sunil Arya
Binary space partitions for axis-parallel line segments: Size-height tradeoffs. Inf. Process. Lett. 84 (4) (2002)
Sunil Arya, Theocharis Malamatos, David M. Mount
Space-efficient approximate Voronoi diagrams. STOC (2002)
Sunil Arya, Theocharis Malamatos, David M. Mount
Entropy-preserving cuttings and space-efficient planar point location. SODA (2001)
Sunil Arya, Siu-Wing Cheng, David M. Mount
Approximation Algorithm for Multiple-Tool Milling. Int. J. Comput. Geom. Appl. 11 (3) (2001)
Sunil Arya, Theocharis Malamatos, David M. Mount
A simple entropy-based algorithm for planar point location. SODA (2001)
Sunil Arya, Theocharis Malamatos, David M. Mount
Nearly Optimal Expected-Case Planar Point Location. FOCS (2000)
Sunil Arya, David M. Mount
Approximate range searching. Comput. Geom. 17 (3-4) (2000)
Sunil Arya, Ho-Yam Addy Fu
Expected-case complexity of approximate nearest neighbor searching. SODA (2000)
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh Hariharan
Efficient Expected-Case Algorithms for Planar Point Location. SWAT (2000)
V. S. Anil Kumar, Sunil Arya, H. Ramesh
Hardness of Set Cover with Intersection 1. ICALP (2000)
Sunil Arya, David M. Mount, Michiel H. M. Smid
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Comput. Geom. 13 (2) (1999)
Sunil Arya, H. Ramesh
-MST Problem. Inf. Process. Lett. 65 (3) (1998)
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) (1998)
Sunil Arya, Siu-Wing Cheng, David M. Mount
Approximation Algorithms for Multiple-Tool Miling. SCG (1998)
Sunil Arya, Michiel H. M. Smid
Efficient Construction of a Bounded-Degree Spanner with Low Weight. Algorithmica 17 (1) (1997)
Sunil Arya, David M. Mount, Onuttom Narayan
Accounting for Boundary Effects in Nearest-Neighbor Searching. Discret. Comput. Geom. 16 (2) (1996)
Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid
Euclidean spanners: short, thin, and lanky. STOC (1995)
Sunil Arya, David M. Mount, Onuttom Narayan
Accounting for Boundary Effects in Nearest Neighbor Searching. SCG (1995)
Sunil Arya, David M. Mount
Approximate Range Searching. SCG (1995)
Sunil Arya, Michiel H. M. Smid
Efficient Construction of a Bounded Degree Spanner with Low Weight. ESA (1994)
Sunil Arya, David M. Mount, Michiel H. M. Smid
Randomized and deterministic algorithms for geometric spanners of small diameter FOCS (1994)
Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu
An Optimal Algorithm for Approximate Nearest Neighbor Searching. SODA (1994)
Sunil Arya, David M. Mount
Algorithms for Fast Vector Quantizaton. Data Compression Conference (1993)
Sunil Arya, David M. Mount
Approximate Nearest Neighbor Queries in Fixed Dimensions. SODA (1993)
Sunil Arya, Daniel DeMenthon, Peter Meer, Larry S. Davis
Textural analysis of range images. Pattern Recognit. Lett. 12 (10) (1991)