Sunil Arya - RankMe

74 papers A* 25A 3B 2Journal 34Unranked 9

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