dblp.uni-trier.dewww.uni-trier.de

Sunil Arya

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
34EESunil Arya, David M. Mount, Antoine Vigneron, Jian Xia: Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. ESA 2008: 112-123
33EESunil Arya, Guilherme Dias da Fonseca, David M. Mount: Tradeoffs in Approximate Range Searching Made Simpler. SIBGRAPI 2008: 237-244
2007
32EESunil Arya, Theocharis Malamatos, David M. Mount: A simple entropy-based algorithm for planar point location. ACM Transactions on Algorithms 3(2): (2007)
31EESunil Arya, Theocharis Malamatos, David M. Mount, Ka Chun Wong: Optimal Expected-Case Planar Point Location. SIAM J. Comput. 37(2): 584-610 (2007)
2006
30EESunil Arya, Theocharis Malamatos, David M. Mount: On the importance of idempotence. STOC 2006: 564-573
29EESunil 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
28EESunil Arya, Theocharis Malamatos, David M. Mount: Space-time tradeoffs for approximate spherical range counting. SODA 2005: 535-544
2003
27EESunil Arya, Ho-Yam Addy Fu: Expected-Case Complexity of Approximate Nearest Neighbor Searching. SIAM J. Comput. 32(3): 793-815 (2003)
2002
26EESunil Arya, Theocharis Malamatos: Linear-size approximate voronoi diagrams. SODA 2002: 147-155
25EESunil Arya, Theocharis Malamatos, David M. Mount: Space-efficient approximate Voronoi diagrams. STOC 2002: 721-730
24EESunil Arya: Binary space partitions for axis-parallel line segments: Size-height tradeoffs. Inf. Process. Lett. 84(4): 201-206 (2002)
2001
23EESunil Arya, Theocharis Malamatos, David M. Mount: Entropy-preserving cuttings and space-efficient planar point location. SODA 2001: 256-261
22EESunil 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
19EEV. S. Anil Kumar, Sunil Arya, H. Ramesh: Hardness of Set Cover with Intersection 1. ICALP 2000: 624-635
18EESunil Arya, Ho-Yam Addy Fu: Expected-case complexity of approximate nearest neighbor searching. SODA 2000: 379-388
17EESunil 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
14EESunil Arya, Siu-Wing Cheng, David M. Mount: Approximation Algorithms for Multiple-Tool Miling. Symposium on Computational Geometry 1998: 297-306
13EESunil Arya, H. Ramesh: A 2.5-Factor Approximation Algorithm for the k-MST Problem. Inf. Process. Lett. 65(3): 117-118 (1998)
12EESunil 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
10EESunil Arya, David M. Mount, Onuttom Narayan: Accounting for Boundary Effects in Nearest-Neighbor Searching. Discrete & Computational Geometry 16(2): 155-176 (1996)
1995
9EESunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid: Euclidean spanners: short, thin, and lanky. STOC 1995: 489-498
8EESunil Arya, David M. Mount: Approximate Range Searching. Symposium on Computational Geometry 1995: 172-181
7EESunil 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
1EESunil Arya, Daniel DeMenthon, Peter Meer, Larry S. Davis: Textural analysis of range images. Pattern Recognition Letters 12(10): 619-626 (1991)

Coauthor Index

1Siu-Wing Cheng [14] [17] [21]
2Gautam Das [9]
3Larry S. Davis [1]
4Daniel DeMenthon [1]
5Guilherme Dias da Fonseca [33]
6Ho-Yam Addy Fu [18] [27]
7Ramesh Hariharan [17]
8V. S. Anil Kumar [19]
9Theocharis Malamatos [20] [22] [23] [25] [26] [28] [29] [30] [31] [32]
10Peter Meer [1]
11David M. Mount [2] [3] [4] [5] [7] [8] [9] [10] [12] [14] [15] [16] [17] [20] [21] [22] [23] [25] [28] [29] [30] [31] [32] [33] [34]
12Onuttom Narayan [7] [10]
13Nathan S. Netanyahu [4] [12]
14H. Ramesh [13] [19]
15Jeffrey S. Salowe [9]
16Ruth Silverman [4] [12]
17Michiel H. M. Smid [5] [6] [9] [11] [15]
18Antoine Vigneron [34]
19Ka Chun Wong [31]
20Angela Y. Wu [4] [12]
21Jian Xia [34]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)