Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: FOCS 2000, pp. 198–207 (2000)
2. Andersson, A., Hagerup, T., Nilsson, S., Raman, R.: Sorting in linear time? In: STOC 1995, pp. 427–436 (1995)
3. Beame, P., Fich, F.E.: Optimal bounds for the predecessor problem. In: STOC 1999: Proceedings of the 31st annual ACM symposium on Theory of computing, pp. 295–304. ACM, New York (1999)
4. Bentley, J.L.: Solutions to Klee’s rectangle problems. Tech. report, Carnegie-Mellon Univ., Pittsburgh, PA (1977)
5. Chazelle, B.: Filtering search: A new approach to query answering. SIAM J. Comput. 15(3), 703–724 (1986)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献