Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Arya, Sunil"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal area-sensitive bounds for polytope approximation
Sunil Arya
,
Guilherme D. da Fonseca
,
David M. Mount
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 363-372
Approximate polytope membership queries
Sunil Arya
,
Guilherme D. da Fonseca
,
David M. Mount
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 579-586
Space-time tradeoffs for approximate nearest neighbor searching
Sunil Arya
,
Theocharis Malamatos
,
David M. Mount
Journal of the ACM
57
(1), 2010, pp. 1: 1-54
A unified approach to approximate proximity searching
Sunil Arya
,
Guilherme D. da Fonseca
,
David M. Mount
Lecture Notes in Computer Science
6346
, 2010, pp. 374-385
Space-time tradeoffs for proximity searching in doubling spaces
Sunil Arya
,
David M. Mount
,
Antoine Vigneron
,
Jian Xia
Lecture Notes in Computer Science
5193
, 2008, pp. 112-123
Optimal expected-case planar point location
Sunil Arya
,
Theocharis Malamatos
,
David M. Mount
,
Ka Chun Wong
SIAM Journal on Computing
37
(2), 2007, pp. 584-610
On the importance of idempotence
Sunil Arya
,
Theocharis Malamatos
,
David M. Mount
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 564-573
Expected-case complexity of approximate nearest neighbor searching
Sunil Arya
,
Ho-Yam Addy Fu
SIAM Journal on Computing
32
(3), 2003, pp. 793-815
Space-efficient approximate Voronoi diagrams
Sunil Arya
,
Theocharis Malamatos
,
David M. Mount
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 721-730
Binary space partitions for axis-parallel line segments: Size-height tradeoffs
Sunil Arya
Information Processing Letters
84
(4), 2002, pp. 201-206
Efficient expected-case algorithms for planar point location
Sunil Arya
,
Siu-Wing Cheng
,
David M. Mount
,
H. Ramesh
Lecture Notes in Computer Science
1851
, 2000, pp. 353-366
Hardness of set cover with intersection 1
V.S. Anil Kumar
,
Sunil Arya
,
H. Ramesh
Lecture Notes in Computer Science
1853
, 2000, pp. 624-635
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Sunil Arya
,
David M. Mount
,
Nathan S. Netanyahu
,
Ruth Silverman
,
Angela Y. Wu
Journal of the ACM
45
(6), 1998, pp. 891-923
A 2.5-factor approximation algorithm for the
k
-MST problem
Sunil Arya
,
H. Ramesh
Information Processing Letters
65
(3), 1998, pp. 117-118
Euclidean spanners: Short, thin, and lanky
Sunil Arya
,
Gautam Das
,
David M. Mount
,
Jeffrey S. Salowe
,
Michiel Smid
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, USA, May 29 - June 1, 1995)
, 1995, pp. 489-498
An optimal algorithm for approximate nearest neighbor searching
Sunil Arya
,
David M. Mount
,
Nathan S. Netanyahu
,
Ruth Silverman
,
Angela Wu
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 573-582
Randomized and deterministic algorithms for geometric spanners of small diameter
Sunil Arya
,
David M. Mount
,
Michiel Smid
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 703-712
Efficient construction of a bounded degree spanner with low weight
Sunil Arya
,
Michiel Smid
Proceedings of the 2nd Annual European Symposium on Algorithms. ESA '94 (Utrecht, The Netherlands, September 26-28, 1994)
LNCS 855
, 1994, pp. 48-59
Approximate nearest neighbor queries in fixed dimensions
Sunil Arya
,
David M. Mount
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993)
, 1993, pp. 271-280