A cell probe lower bound for dynamic nearest-neighbor searching

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 779-780

  Alstrup, Stephen ^a   Husfeldt, Thore ^b   Rauhe, Theis ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b LUND UNIVERSITY   (Sweden)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

EID: 38749139655     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. P. K. Agarwal, D. Eppstein, and J. Matougek. Dynamic algorithms for half-space reporting, proximity problems, and geometric minimum spanning trees. In FOCS, 1992.
2. Pankaj K. Agarwal , Jiří Matoušek, Ray shooting and parametric search, SIAM Journal on Computing, v.22 n.4, p.794-806, Aug. 1993 [doi〉10.1137/0222051]
3. Stephen Alstrup , Thore Husfeldt , Theis Rauhe, Marked Ancestor Problems, Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p.534, November 08-11, 1998
4. Arnon Amir , Alon Efrat , Piotr Indyk , Hanan Samet, Efficient Regular Data Structures and Algorithms for Location and Proximity Problems, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.160, October 17-18, 1999
5. Omer Barkol , Yuval Rabani, Tighter bounds for nearest neighbor search and related problems in the cell probe model, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.388-396, May 21-23, 2000, Portland, Oregon, United States [doi〉10.1145/335305.335350]
6. Paul Beame , Faith E. Fich, Optimal bounds for the predecessor problem, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.295-304, May 01-04, 1999, Atlanta, Georgia, United States [doi〉10.1145/ 301250.301323]
7. Allan Borodin , Rafail Ostrovsky , Yuval Rabani, Lower bounds for high dimensional nearest neighbor search and related problems, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.312-321, May 01-04, 1999, Atlanta, Georgia, United States [doi〉10.1145/301250.301330]
8. Amit Chakrabarti , Bernard Chazelle , Benjamin Gum , Alexey Lvov, A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.305-311, May 01-04, 1999, Atlanta, Georgia, United States [doi〉10.1145/301250.301325]
9. M. Staid. Closest-point problems in computational geometry. In Handbook of Comp. Geom. Elsevier, 2000.