On the difficulty of range searching

Computational Geometry: Theory and Applications

Volumn 8, Issue 3, 1997, Pages 115-122

  Andersson, Arne ^a   Swanson, Kurt ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

Data structures; Lower bound; Range searching

Indexed keywords

EID: 0003935390     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(97)00005-9     Document Type: Article

References (18)

1. A. Andersson, Sublogarithmic searching without multiplications, in: Proc. 36th IEEE Symposium on Foundations of Computer Science (1995) 655-663.
2. A. Andersson, Faster deterministic sorting and searching in linear space, in: Proc. 37th IEEE Symposium on Foundations of Computer Science (1996).
3. J.L. Bentley, Decomposable searching problems, Inform. Process. Lett. 8 (5) (1979) 244-251.
4. J.L. Bentley and H.A. Maurer, Efficient worst-case data structures for range searching, Acta Inform. 13 (2) (1980) 155-168.
5. B. Chazelle, Filtering search: a new approach to query-answering, SIAM J. Comput. 15 (3) (1986) 703-724.
6. B. Chazelle, Slimming down search structures: A functional approach to algorithm design, in: Proc. 26th IEEE Symposium on Foundations of Computer Science (1985) 165-174.
7. B. Chazelle, A functional approach to data structures and its use in multidimensional searching, SIAM J. Comput. 17 (3) (1988) 427-462.
8. B. Chazelle, Lower bounds for orthogonal range searching: I. The reporting case, J. ACM 37 (2) (1990) 200-212.
9. B. Chazelle, Lower bounds for orthogonal range searching: II. The arithmetic model, J. ACM 37 (3) (1990) 439-463.
10. R.A. Finkel and J.L. Bentley, Quad trees: a data structure for retrieval on composite keys, Acta Inform. 4 (1) (1974) 1-9.
11. M.L. Fredman and D.E. Willard, Surpassing the information theoretic barrier with fusion trees, J. Comput. System Sci. 47 (3) (1993) 424-436.
12. G.S. Lueker, A data structure for orthogonal range queries, in: Proc. 19th IEEE Symposium on Foundations of Computer Science (1978) 28-34.
13. E.M. McCreight, Priority search trees, SIAM J. Comput. 14 (2) (1985) 257-276.
14. P.B. Miltersen, Personal communication.
15. P.B. Miltersen, Lower bounds for union-split-find related problems on random access machines, in: Proc. 26th ACM Symposium on Theory of Computing (1994) 625-634.
16. P.B. Miltersen, N. Nisan, S. Safra and A. Wigderson, On data structures and asymmetric communication complexity, in: Proc. 27th ACM Symposium on Theory of Computing (1995).
17. J.B. Saxe and J.L. Bentley, Transforming static data structures to dynamic structures, in: Proc. 20th IEEE Symposium on Foundations of Computer Science (1979) 148-168.
18. D.E. Willard, A new time complexity for orthogonal range queries, in: Proc. 20th Allerton Conf. Commun. Control Comput. (1982) 462-471.