default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSunil Arya
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Sunil Arya
, Guilherme Dias da Fonseca, David M. Mount:
Economical Convex Coverings and Applications. SIAM J. Comput. 53(4): 1002-1038 (2024)- 2023
- [c38]Sunil Arya, David M. Mount:
Optimal Volume-Sensitive Bounds for Polytope Approximation. SoCG 2023: 9:1-9:16 - [c37]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Economical Convex Coverings and Applications. SODA 2023: 1834-1861 - [i10]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Economical Convex Coverings and Applications. CoRR abs/2303.08349 (2023) - [i9]Sunil Arya, David M. Mount:
Optimal Volume-Sensitive Bounds for Polytope Approximation. CoRR abs/2303.09586 (2023) - [i8]Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. CoRR abs/2306.15621 (2023) - [i7]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Area-Sensitive Bounds for Polytope Approximation. CoRR abs/2306.15648 (2023) - 2022
- [j19]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): 35:1-35:29 (2022) - 2020
- [c36]Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. SODA 2020: 786-805
2010 – 2019
- 2019
- [c35]Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. SODA 2019: 355-372 - [i6]Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. CoRR abs/1910.14459 (2019) - 2018
- [j18]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Polytope Membership Queries. SIAM J. Comput. 47(1): 1-51 (2018) - [c34]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. ESA 2018: 3:1-3:14 - [i5]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. CoRR abs/1807.00484 (2018) - 2017
- [j17]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
On the Combinatorial Complexity of Approximating Polytopes. Discret. Comput. Geom. 58(4): 849-870 (2017) - [c33]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Near-Optimal epsilon-Kernel Construction and Related Problems. SoCG 2017: 10:1-10:15 - [c32]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Approximate Polytope Membership. SODA 2017: 270-288 - [i4]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Near-Optimal ε-Kernel Construction and Related Problems. CoRR abs/1703.10868 (2017) - 2016
- [c31]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
On the Combinatorial Complexity of Approximating Polytopes. SoCG 2016: 11:1-11:15 - [c30]Sunil Arya, David M. Mount:
A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees. SODA 2016: 1220-1233 - [i3]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
On the Combinatorial Complexity of Approximating Polytopes. CoRR abs/1604.01175 (2016) - [i2]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Polytope Membership Queries. CoRR abs/1604.01183 (2016) - [i1]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Approximate Polytope Membership. CoRR abs/1612.01696 (2016) - 2015
- [c29]Sunil Arya, David M. Mount, Eunhui Park:
Approximate Geometric MST Range Queries. SoCG 2015: 781-795 - 2014
- [c28]Sunil Arya, Timothy M. Chan:
Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels. SoCG 2014: 416 - 2012
- [j16]Sunil Arya, David M. Mount, Jian Xia:
Tight Lower Bounds for Halfspace Range Searching. Discret. Comput. Geom. 47(4): 711-730 (2012) - [c27]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal area-sensitive bounds for polytope approximation. SCG 2012: 363-372 - [c26]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Polytope approximation and the Mahler volume. SODA 2012: 29-42 - 2011
- [j15]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: 983752:1-983752:7 (2011) - [c25]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate polytope membership queries. STOC 2011: 579-586 - 2010
- [c24]Sunil Arya, David M. Mount, Jian Xia:
Tight lower bounds for halfspace range searching. SCG 2010: 29-37 - [c23]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
A Unified Approach to Approximate Proximity Searching. ESA (1) 2010: 374-385
2000 – 2009
- 2009
- [j14]Sunil Arya, Theocharis Malamatos, David M. Mount:
The Effect of Corners on the Complexity of Approximate Range Searching. Discret. Comput. Geom. 41(3): 398-443 (2009) - [j13]Sunil Arya, Theocharis Malamatos, David M. Mount:
Space-time tradeoffs for approximate nearest neighbor searching. J. ACM 57(1): 1:1-1:54 (2009) - 2008
- [c22]Sunil Arya, David M. Mount, Antoine Vigneron, Jian Xia:
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. ESA 2008: 112-123 - [c21]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Tradeoffs in Approximate Range Searching Made Simpler. SIBGRAPI 2008: 237-244 - 2007
- [j12]Sunil Arya, Theocharis Malamatos, David M. Mount, Ka Chun Wong:
Optimal Expected-Case Planar Point Location. SIAM J. Comput. 37(2): 584-610 (2007) - [j11]Sunil Arya, Theocharis Malamatos, David M. Mount:
A simple entropy-based algorithm for planar point location. ACM Trans. Algorithms 3(2): 17 (2007) - 2006
- [c20]Sunil Arya, Theocharis Malamatos, David M. Mount:
The effect of corners on the complexity of approximate range searching. SCG 2006: 11-20 - [c19]Sunil Arya, Theocharis Malamatos, David M. Mount:
On the importance of idempotence. STOC 2006: 564-573 - 2005
- [c18]Sunil Arya, Theocharis Malamatos, David M. Mount:
Space-time tradeoffs for approximate spherical range counting. SODA 2005: 535-544 - 2004
- [r1]Sunil Arya, David M. Mount:
Computational Geometry. Handbook of Data Structures and Applications 2004 - 2003
- [j10]Sunil Arya, Ho-Yam Addy Fu:
Expected-Case Complexity of Approximate Nearest Neighbor Searching. SIAM J. Comput. 32(3): 793-815 (2003) - 2002
- [j9]Sunil Arya:
Binary space partitions for axis-parallel line segments: Size-height tradeoffs. Inf. Process. Lett. 84(4): 201-206 (2002) - [c17]Sunil Arya, Theocharis Malamatos:
Linear-size approximate voronoi diagrams. SODA 2002: 147-155 - [c16]Sunil Arya, Theocharis Malamatos, David M. Mount:
Space-efficient approximate Voronoi diagrams. STOC 2002: 721-730 - 2001
- [j8]Sunil Arya, Siu-Wing Cheng, David M. Mount:
Approximation Algorithm for Multiple-Tool Milling. Int. J. Comput. Geom. Appl. 11(3): 339-372 (2001) - [c15]Sunil Arya, Theocharis Malamatos, David M. Mount:
Entropy-preserving cuttings and space-efficient planar point location. SODA 2001: 256-261 - [c14]Sunil Arya, Theocharis Malamatos, David M. Mount:
A simple entropy-based algorithm for planar point location. SODA 2001: 262-268 - 2000
- [j7]Sunil Arya, David M. Mount:
Approximate range searching. Comput. Geom. 17(3-4): 135-152 (2000) - [c13]Sunil Arya, Theocharis Malamatos, David M. Mount:
Nearly Optimal Expected-Case Planar Point Location. FOCS 2000: 208-218 - [c12]V. S. Anil Kumar, Sunil Arya, H. Ramesh:
Hardness of Set Cover with Intersection 1. ICALP 2000: 624-635 - [c11]Sunil Arya, Ho-Yam Addy Fu:
Expected-case complexity of approximate nearest neighbor searching. SODA 2000: 379-388 - [c10]Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh Hariharan:
Efficient Expected-Case Algorithms for Planar Point Location. SWAT 2000: 353-366
1990 – 1999
- 1999
- [j6]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
- [j5]Sunil Arya, H. Ramesh:
A 2.5-Factor Approximation Algorithm for the k-MST Problem. Inf. Process. Lett. 65(3): 117-118 (1998) - [j4]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) - [c9]Sunil Arya, Siu-Wing Cheng, David M. Mount:
Approximation Algorithms for Multiple-Tool Miling. SCG 1998: 297-306 - 1997
- [j3]Sunil Arya, Michiel H. M. Smid:
Efficient Construction of a Bounded-Degree Spanner with Low Weight. Algorithmica 17(1): 33-54 (1997) - 1996
- [j2]Sunil Arya, David M. Mount, Onuttom Narayan:
Accounting for Boundary Effects in Nearest-Neighbor Searching. Discret. Comput. Geom. 16(2): 155-176 (1996) - 1995
- [c8]Sunil Arya, David M. Mount:
Approximate Range Searching. SCG 1995: 172-181 - [c7]Sunil Arya, David M. Mount, Onuttom Narayan:
Accounting for Boundary Effects in Nearest Neighbor Searching. SCG 1995: 336-344 - [c6]Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid:
Euclidean spanners: short, thin, and lanky. STOC 1995: 489-498 - 1994
- [c5]Sunil Arya, Michiel H. M. Smid:
Efficient Construction of a Bounded Degree Spanner with Low Weight. ESA 1994: 48-59 - [c4]Sunil Arya, David M. Mount, Michiel H. M. Smid:
Randomized and deterministic algorithms for geometric spanners of small diameter. FOCS 1994: 703-712 - [c3]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
- [c2]Sunil Arya, David M. Mount:
Algorithms for Fast Vector Quantizaton. Data Compression Conference 1993: 381-390 - [c1]Sunil Arya, David M. Mount:
Approximate Nearest Neighbor Queries in Fixed Dimensions. SODA 1993: 271-280 - 1991
- [j1]Sunil Arya, Daniel DeMenthon, Peter Meer, Larry S. Davis:
Textural analysis of range images. Pattern Recognit. Lett. 12(10): 619-626 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
