Selected papers that cite this one
- Bernard Chazelle. Computational geometry: A restrospective. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 75-94, Montréal, Québec, Canada, 23-25 May 1994.
- Bernard Chazelle. Lower bounds for off-line range searching. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 733-740, Las Vegas, Nevada, 29 May-1 June 1995.
- M. L. Fredman. The spanning bound as a measure of range query complexity. Journal of Algorithms, 2(1):77-87, March 1981.
- Paris Kanellakis, Sridhar Ramaswamy, Darren E. Vengroff, and Jeffrey Scott Vitter. Indexing for data models with constraints and classes. Journal of Computer and System Sciences, 52(3):589-612, June 1996.
- Dan E. Willard. Application of range query theory to relational data base join and selection operations. Journal of Computer and System Sciences, 52(1):157-169, February 1996.