The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sunil Arya: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sunil Arya, David M. Mount, Onuttom Narayan
    Accounting for Boundary Effects in Nearest Neighbor Searching. [Citation Graph (3, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:336-344 [Conf]
  2. Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu
    An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions. [Citation Graph (3, 0)][DBLP]
    J. ACM, 1998, v:45, n:6, pp:891-923 [Journal]
  3. Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu
    An Optimal Algorithm for Approximate Nearest Neighbor Searching. [Citation Graph (2, 0)][DBLP]
    SODA, 1994, pp:573-582 [Conf]
  4. Sunil Arya, David M. Mount
    Algorithms for Fast Vector Quantizaton. [Citation Graph (1, 0)][DBLP]
    Data Compression Conference, 1993, pp:381-390 [Conf]
  5. Sunil Arya, Siu-Wing Cheng, David M. Mount
    Approximation Algorithms for Multiple-Tool Miling. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:297-306 [Conf]
  6. Sunil Arya, David M. Mount
    Approximate Range Searching. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:172-181 [Conf]
  7. Sunil Arya, Theocharis Malamatos, David M. Mount
    The effect of corners on the complexity of approximate range searching. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:11-20 [Conf]
  8. Sunil Arya, Michiel H. M. Smid
    Efficient Construction of a Bounded Degree Spanner with Low Weight. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:48-59 [Conf]
  9. Sunil Arya, Theocharis Malamatos, David M. Mount
    Nearly Optimal Expected-Case Planar Point Location. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:208-218 [Conf]
  10. Sunil Arya, David M. Mount, Michiel H. M. Smid
    Randomized and deterministic algorithms for geometric spanners of small diameter [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:703-712 [Conf]
  11. V. S. Anil Kumar, Sunil Arya, H. Ramesh
    Hardness of Set Cover with Intersection 1. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:624-635 [Conf]
  12. Sunil Arya, Ho-Yam Addy Fu
    Expected-case complexity of approximate nearest neighbor searching. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:379-388 [Conf]
  13. Sunil Arya, Theocharis Malamatos
    Linear-size approximate voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:147-155 [Conf]
  14. Sunil Arya, David M. Mount
    Approximate Nearest Neighbor Queries in Fixed Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:271-280 [Conf]
  15. Sunil Arya, Theocharis Malamatos, David M. Mount
    Entropy-preserving cuttings and space-efficient planar point location. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:256-261 [Conf]
  16. Sunil Arya, Theocharis Malamatos, David M. Mount
    A simple entropy-based algorithm for planar point location. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:262-268 [Conf]
  17. Sunil Arya, Theocharis Malamatos, David M. Mount
    Space-time tradeoffs for approximate spherical range counting. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:535-544 [Conf]
  18. Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid
    Euclidean spanners: short, thin, and lanky. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:489-498 [Conf]
  19. Sunil Arya, Theocharis Malamatos, David M. Mount
    Space-efficient approximate Voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:721-730 [Conf]
  20. Sunil Arya, Theocharis Malamatos, David M. Mount
    On the importance of idempotence. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:564-573 [Conf]
  21. Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh Hariharan
    Efficient Expected-Case Algorithms for Planar Point Location. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:353-366 [Conf]
  22. Sunil Arya, Michiel H. M. Smid
    Efficient Construction of a Bounded-Degree Spanner with Low Weight. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:1, pp:33-54 [Journal]
  23. Sunil Arya, David M. Mount
    Approximate range searching. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:17, n:3-4, pp:135-152 [Journal]
  24. Sunil Arya, David M. Mount, Michiel H. M. Smid
    Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:13, n:2, pp:91-107 [Journal]
  25. Sunil Arya, David M. Mount, Onuttom Narayan
    Accounting for Boundary Effects in Nearest-Neighbor Searching. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:16, n:2, pp:155-176 [Journal]
  26. Sunil Arya, Siu-Wing Cheng, David M. Mount
    Approximation Algorithm for Multiple-Tool Milling. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:3, pp:339-372 [Journal]
  27. Sunil Arya
    Binary space partitions for axis-parallel line segments: Size-height tradeoffs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:4, pp:201-206 [Journal]
  28. Sunil Arya, H. Ramesh
    A 2.5-Factor Approximation Algorithm for the k-MST Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:3, pp:117-118 [Journal]
  29. Sunil Arya, Daniel DeMenthon, Peter Meer, Larry S. Davis
    Textural analysis of range images. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1991, v:12, n:10, pp:619-626 [Journal]
  30. Sunil Arya, Ho-Yam Addy Fu
    Expected-Case Complexity of Approximate Nearest Neighbor Searching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:3, pp:793-815 [Journal]
  31. Sunil Arya, Theocharis Malamatos, David M. Mount, Ka Chun Wong
    Optimal Expected-Case Planar Point Location. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:584-610 [Journal]
  32. Sunil Arya, Theocharis Malamatos, David M. Mount
    A simple entropy-based algorithm for planar point location. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]

  33. Tight lower bounds for halfspace range searching. [Citation Graph (, )][DBLP]


  34. Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. [Citation Graph (, )][DBLP]


  35. A Unified Approach to Approximate Proximity Searching. [Citation Graph (, )][DBLP]


  36. Tradeoffs in Approximate Range Searching Made Simpler. [Citation Graph (, )][DBLP]


  37. The Effect of Corners on the Complexity of Approximate Range Searching. [Citation Graph (, )][DBLP]


Search in 0.086secs, Finished in 0.088secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002