Author:
Agarwal Pankaj K.,Govindarajan Sathish,Muthukrishnan S.
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, volume 223 of Contemporary Mathematics, pages 1–56. American Mathematical Society, Providence, RI, 1999.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison Wesley Press, 1983.
3. S. Alstrup, G. Brodal, and T. Rauhe. New data structures for ortogonal range searching. In Proc. 41th Annual IEEE Symp. Foundations of Comp. Sci., pages 198–207, 2000.
4. J. L. Bentley. Multidimensional divide-and-conquer. Commun. ACM, 23(4):214–229, 1980.
5. B. Chazelle. Filtering search: A new approach to query-answering. SIAM J. Comput., 15(3):703–724, 1986.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献