Sunil Arya

According to our database1, Sunil Arya authored at least 47 papers between 1991 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Approximate Polytope Membership Queries.
SIAM J. Comput., 2018

Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
On the Combinatorial Complexity of Approximating Polytopes.
Discrete & Computational Geometry, 2017

Near-Optimal ε-Kernel Construction and Related Problems.
CoRR, 2017

Optimal Approximate Polytope Membership.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Near-Optimal epsilon-Kernel Construction and Related Problems.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Approximate Geometric MST Range Queries.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2012
Tight Lower Bounds for Halfspace Range Searching.
Discrete & Computational Geometry, 2012

Polytope approximation and the Mahler volume.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Optimal area-sensitive bounds for polytope approximation.
Proceedings of the Symposuim on Computational Geometry 2012, 2012

2011
Impedance-Based Miniaturized Biosensor for Ultrasensitive and Fast Prostate-Specific Antigen Detection.
J. Sensors, 2011

2010
A Unified Approach to Approximate Proximity Searching.
Proceedings of the Algorithms, 2010

2009
Space-time tradeoffs for approximate nearest neighbor searching.
J. ACM, 2009

The Effect of Corners on the Complexity of Approximate Range Searching.
Discrete & Computational Geometry, 2009

2008
Tradeoffs in Approximate Range Searching Made Simpler.
Proceedings of the SIBGRAPI 2008, 2008

Space-Time Tradeoffs for Proximity Searching in Doubling Spaces.
Proceedings of the Algorithms, 2008

2007
A simple entropy-based algorithm for planar point location.
ACM Trans. Algorithms, 2007

Optimal Expected-Case Planar Point Location.
SIAM J. Comput., 2007

2006
On the importance of idempotence.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2005
Space-time tradeoffs for approximate spherical range counting.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Computational Geometry.
Proceedings of the Handbook of Data Structures and Applications., 2004

2003
Expected-Case Complexity of Approximate Nearest Neighbor Searching.
SIAM J. Comput., 2003

2002
Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
Inf. Process. Lett., 2002

Space-efficient approximate Voronoi diagrams.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Linear-size approximate voronoi diagrams.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Approximation Algorithm for Multiple-Tool Milling.
Int. J. Comput. Geometry Appl., 2001

Entropy-preserving cuttings and space-efficient planar point location.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Approximate range searching.
Comput. Geom., 2000

Efficient Expected-Case Algorithms for Planar Point Location.
Proceedings of the Algorithm Theory, 2000

Hardness of Set Cover with Intersection 1.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Nearly Optimal Expected-Case Planar Point Location.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions.
Comput. Geom., 1999

1998
An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions.
J. ACM, 1998

A 2.5-Factor Approximation Algorithm for the k-MST Problem.
Inf. Process. Lett., 1998

Approximation Algorithms for Multiple-Tool Miling.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
Efficient Construction of a Bounded-Degree Spanner with Low Weight.
Algorithmica, 1997

1996
Accounting for Boundary Effects in Nearest-Neighbor Searching.
Discrete & Computational Geometry, 1996

1995
Euclidean spanners: short, thin, and lanky.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994
An Optimal Algorithm for Approximate Nearest Neighbor Searching.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Randomized and deterministic algorithms for geometric spanners of small diameter
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993
Approximate Nearest Neighbor Queries in Fixed Dimensions.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Algorithms for Fast Vector Quantizaton.
Proceedings of the IEEE Data Compression Conference, 1993

1991
Textural analysis of range images.
Pattern Recognit. Lett., 1991


  Loading...