The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David M. Mount: [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. David M. Mount, Ruth Silverman
    Algorithms for covering and packing and applications to CAD/CAM (abstract only): preliminary results. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1987, pp:439- [Conf]
  6. Songrit Maneewongvatana, David M. Mount
    An Empirical Study of a New Approach to Nearest Neighbor Searching. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:172-187 [Conf]
  7. F. Betul Atalay, David M. Mount
    Interpolation over Light Fields with Applications in Computer Graphics. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:56-68 [Conf]
  8. David M. Mount, Fan-Tao Pu
    Binary Space Partitions in Plücker Space. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:94-113 [Conf]
  9. Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine
    Testing Simple Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:387- [Conf]
  10. Michael B. Dillencourt, David M. Mount, Alan Saalfeld
    On the Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:49-54 [Conf]
  11. Ovidiu Daescu, Jun Luo, David M. Mount
    Proximity Problems on Line Segments Spanned by Points. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:227-231 [Conf]
  12. David M. Mount, Nathan S. Netanyahu
    Efficient Algorithms for Robust Circular Arc Estimators. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:79-84 [Conf]
  13. David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
    Quantile approximation for robust statistical estimation. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  14. 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]
  15. Sunil Arya, David M. Mount
    Approximate Range Searching. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:172-181 [Conf]
  16. 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]
  17. Jeff Erickson, Sariel Har-Peled, David M. Mount
    On the least median square problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:273-279 [Conf]
  18. Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
    The analysis of a simple k-means clustering algorithm. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:100-109 [Conf]
  19. Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
    A local search approximation algorithm for k-means clustering. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:10-18 [Conf]
  20. Joseph S. B. Mitchell, David M. Mount, Subhash Suri
    Query-Sensitive Ray Shooting. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:359-368 [Conf]
  21. David M. Mount
    Storing the Subdivision of a Polyhedral Surface. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:150-158 [Conf]
  22. David M. Mount
    Intersection Detection and Separators for Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:303-311 [Conf]
  23. David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne
    Improved Algorithms for Robust Point Pattern Matching and Applications to Image Registration. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:155-164 [Conf]
  24. David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
    A computational framework for incremental motion. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:200-209 [Conf]
  25. David M. Mount, Alan Saalfeld
    Globally-Equiangular Triangulations of Co-Circular Points in 0(n log n) Time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:143-152 [Conf]
  26. 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]
  27. 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]
  28. Subir Kumar Ghosh, David M. Mount
    An Output Sensitive Algorithm for Computing Visibility Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:11-19 [Conf]
  29. Songrit Maneewongvatana, David M. Mount
    On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (1), 2001, pp:842-851 [Conf]
  30. F. Betul Atalay, David M. Mount
    Pointerless Implementation of Hierarchical Simplicial Meshes and Efficient Neighbor Finding in Arbitrary Dimensions. [Citation Graph (0, 0)][DBLP]
    IMR, 2004, pp:15-26 [Conf]
  31. David M. Mount
    The ABCs of AVDs: Geometric Retrieval Made Simple. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:2- [Conf]
  32. Sunil Arya, David M. Mount
    Approximate Nearest Neighbor Queries in Fixed Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:271-280 [Conf]
  33. 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]
  34. 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]
  35. 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]
  36. Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan
    Algorithms for facility location problems with outliers. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:642-651 [Conf]
  37. Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
    Computing Nearest Neighbors for Moving Points and Applications to Clustering. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:931-932 [Conf]
  38. David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu
    A Practical Approximation Algorithm for the LMS Line Estimator. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:473-482 [Conf]
  39. Michael Murphy, David M. Mount, Carl W. Gable
    A point-placement strategy for conforming Delaunay tetrahedralization. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:67-74 [Conf]
  40. Jirí Matousek, David M. Mount, Nathan S. Netanyahu
    Efficient Randomized Algorithms for the Repeated Median Line Estimator. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:74-82 [Conf]
  41. 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]
  42. Sunil Arya, Theocharis Malamatos, David M. Mount
    Space-efficient approximate Voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:721-730 [Conf]
  43. Sunil Arya, Theocharis Malamatos, David M. Mount
    On the importance of idempotence. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:564-573 [Conf]
  44. László Babai, D. Yu. Grigoryev, David M. Mount
    Isomorphism of Graphs with Bounded Eigenvalue Multiplicity [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:310-324 [Conf]
  45. 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]
  46. Minkyoung Cho, David M. Mount
    Improved Approximation Bounds for Planar Point Pattern Matching. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:432-443 [Conf]
  47. Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko, Steven Skiena
    Point Probe Decision Trees for Geometric Concept Classes. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:95-106 [Conf]
  48. Songrit Maneewongvatana, David M. Mount
    The Analysis of a Probabilistic Approach to Nearest Neighbor Searching. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:276-286 [Conf]
  49. F. Betul Atalay, David M. Mount
    Ray Interpolants for Fast Ray-Tracing Reflections and Refractions. [Citation Graph (0, 0)][DBLP]
    WSCG (Short Papers), 2002, pp:1-8 [Conf]
  50. Sharat Chandran, Sung Kwon Kim, David M. Mount
    Parallel Computational Geometry of Rectangles. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:1, pp:25-49 [Journal]
  51. Jirí Matousek, David M. Mount, Nathan S. Netanyahu
    Efficient Randomized Algorithms for the Repeated Median Line Estimator. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:2, pp:136-150 [Journal]
  52. Esther M. Arkin, Patrice Belleville, Joseph S. B. Mitchell, David M. Mount, Kathleen Romanik, Steven Salzberg, Diane L. Souvaine
    Testing Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:97-114 [Journal]
  53. 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]
  54. 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]
  55. Ovidiu Daescu, Jun Luo, David M. Mount
    Proximity problems on line segments spanned by points. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:33, n:3, pp:115-129 [Journal]
  56. Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
    A local search approximation algorithm for k-means clustering. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:2-3, pp:89-112 [Journal]
  57. David M. Mount
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:1-2, pp:1-0 [Journal]
  58. David M. Mount, Nathan S. Netanyahu
    Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:19, n:1, pp:1-33 [Journal]
  59. David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu
    Chromatic nearest neighbor searching: A query sensitive approach. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:17, n:3-4, pp:97-119 [Journal]
  60. Songrit Maneewongvatana, David M. Mount
    Analysis of approximate nearest neighbor searching with clustered point sets [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  61. Pankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled, John Hershberger, Christian S. Jensen, Lydia E. Kavraki, Patrice Koehl, Ming C. Lin, Dinesh Manocha, Dimitris N. Metaxas, Brian Mirtich, David M. Mount, S. Muthukrishnan, Dinesh K. Pai, Elisha Sacks, Jack Snoeyink, Subhash Suri, Ouri Wolfson
    Algorithmic issues in modeling motion. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 2002, v:34, n:4, pp:550-572 [Journal]
  62. David M. Mount, Nathan S. Netanyahu
    Computationally Efficient Algorithms for High-Dimensional Robust Estimators. [Citation Graph (0, 0)][DBLP]
    CVGIP: Graphical Model and Image Processing, 1994, v:56, n:4, pp:289-303 [Journal]
  63. David M. Mount, Ruth Silverman, Angela Y. Wu
    On the Area of Overlap of Translated Polygons. [Citation Graph (0, 0)][DBLP]
    Computer Vision and Image Understanding, 1996, v:64, n:1, pp:53-61 [Journal]
  64. 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]
  65. David M. Mount
    Storing the Subdivision of a Polyhedral Surface. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1987, v:2, n:, pp:153-174 [Journal]
  66. Jeff Erickson, Sariel Har-Peled, David M. Mount
    On the Least Median Square Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:593-607 [Journal]
  67. 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]
  68. Sharat Chandran, David M. Mount
    A parallel algorithm for enclosed and enclosing triangles. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:2, pp:191-214 [Journal]
  69. Michael B. Dillencourt, David M. Mount, Nathan S. Netanyahu
    A randomized algorithm for slope selection. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:1, pp:1-27 [Journal]
  70. Mark Keil, David M. Mount, Stephen K. Wismath
    Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:5, pp:535-552 [Journal]
  71. Joseph S. B. Mitchell, David M. Mount, Subhash Suri
    Query-Sensitive Ray Shooting. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:4, pp:317-347 [Journal]
  72. David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
    Quantile Approximation for Robust Statistical Estimation and k-Enclosing Problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:6, pp:593-608 [Journal]
  73. Michael Murphy, David M. Mount, Carl W. Gable
    A Point-Placement Strategy for Conforming Delaunay Tetrahedralization. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:6, pp:669-682 [Journal]
  74. Y. Ansel Teng, David M. Mount, Enrico Puppo, Larry S. Davis
    Parallelizing and Algorithm for Visibility on Polyhedral Terrain. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:1/2, pp:75-84 [Journal]
  75. Nargess Memarsadeghi, David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne
    A Fast Implementation of the Isodata Clustering Algorithm. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2007, v:17, n:1, pp:71-103 [Journal]
  76. David M. Mount, Ruth Silverman
    Packing and Covering the Plane with Translates of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:4, pp:564-580 [Journal]
  77. Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
    An Efficient k-Means Clustering Algorithm: Analysis and Implementation. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2002, v:24, n:7, pp:881-892 [Journal]
  78. David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne
    Efficient algorithms for robust feature matching. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1999, v:32, n:1, pp:17-38 [Journal]
  79. Subir Kumar Ghosh, David M. Mount
    An Output-Sensitive Algorithm for Computing Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:5, pp:888-910 [Journal]
  80. T. Yung Kong, David M. Mount, A. W. Roscoe
    The Decomposition of a Rectangle into Rectangles of Minimal Perimeter. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1215-1231 [Journal]
  81. Joseph S. B. Mitchell, David M. Mount, Christos H. Papadimitriou
    The Discrete Geodesic Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:4, pp:647-668 [Journal]
  82. David M. Mount
    The Number of Shortest Paths on the Surface of a Polyhedron. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:4, pp:593-611 [Journal]
  83. David M. Mount, Tapas Kanungo, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu
    Approximating large convolutions in digital images. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Image Processing, 2001, v:10, n:12, pp:1826-1835 [Journal]
  84. David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu
    A practical approximation algorithm for the LMS line estimator. [Citation Graph (0, 0)][DBLP]
    Computational Statistics & Data Analysis, 2007, v:51, n:5, pp:2461-2486 [Journal]
  85. David M. Mount
    Invited Lecture: On Approximate Range Searching - or - Get in Shape; Round is a Good Choice. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  86. Nargess Memarsadeghi, David M. Mount
    Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2007, pp:503-510 [Conf]
  87. 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]
  88. 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]

  89. Compressing Kinetic Data from Sensor Networks. [Citation Graph (, )][DBLP]


  90. Embedding and similarity search for point sets under translation. [Citation Graph (, )][DBLP]


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


  92. A dynamic data structure for approximate range searching. [Citation Graph (, )][DBLP]


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


  94. Spatio-temporal Range Searching over Compressed Kinetic Sensor Data. [Citation Graph (, )][DBLP]


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


  96. The Cost of Compatible Refinement of Simplex Decomposition Trees. [Citation Graph (, )][DBLP]


  97. Maintaining Nets and Net Trees under Incremental Motion. [Citation Graph (, )][DBLP]


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


  99. Improved Approximation Bounds for Planar Point Pattern Matching. [Citation Graph (, )][DBLP]


  100. Approximation algorithm for the kinetic robust K-center problem. [Citation Graph (, )][DBLP]


  101. Approximate range searching: The absolute model. [Citation Graph (, )][DBLP]


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


Search in 0.031secs, Finished in 0.035secs
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