A cell probe lower bound for dynamic nearest-neighbor searching

Authors:
Stephen Alstrup;Thore Husfeldt;Theis Rauhe
Affiliations:
IT University of Copenhagen, Glentevej 67, DK-2400 Copenhagen, NV;Department of Computer Science, Lund University, Sweden;IT University of Copenhagen, Glentevej 67, DK-2400 Copenhagen, NV
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Ray shooting and parametric search

SIAM Journal on Computing
Optimal bounds for the predecessor problem

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Lower bounds for high dimensional nearest neighbor search and related problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Tighter bounds for nearest neighbor search and related problems in the cell probe model

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Marked Ancestor Problems

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Efficient Regular Data Structures and Algorithms for Location and Proximity Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Hi-index	0.00