Lower bounds for off-line range searching

Discrete and Computational Geometry

Volumn 17, Issue 1, 1997, Pages 53-65

  Chazelle, B ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031539718     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02770864     Document Type: Article

References (20)

1. Alon, N., Spencer, J. The Probabilistic Method, Wiley, New York, 1992.
2. Beck, J., Chen, W. W. L. Irregularities of Distribution, Cambridge Tracts in Mathematics, vol. 89, Cambridge University Press, Cambridge, 1987.
3. Chazelle, B. Lower bounds on the complexity of polytope range searching, J. Amer. Math. Soc., 2 (1989), 637-666.
4. Chazelle, B. Lower bounds for orthogonal range searching: II. The arithmetic model, J. Assoc. Comput. Mach., 37 (1990), 439-463.
5. Chazelle, B. Computational geometry: A retrospective, in: Computing in Euclidean Geometry, 2nd edn., eds. D.-Z. Du and F. Hwang, World Scientific Press, Singapore, 1995, pp. 22-46.
6. Chazelle, B. A spectral approach to lower bounds with applications to geometric searching, SIAM J. Comput. (1996), to appear.
7. Chazelle, B., Rosenberg, B. Lower bounds on the complexity of simplex range reporting on a pointer machine, Comput. Geom. Theory Appl. 5 (1996), 237-247. Preliminary version in Proc. 19th ICALP, LNCS 623, Springer-Verlag, Berlin, 1992, pp. 439-449.
8. Chazelle, B., Rosenberg, B. Lower bounds on the complexity of simplex range reporting on a pointer machine, Comput. Geom. Theory Appl. 5 (1996), 237-247. Preliminary version in Proc. 19th ICALP, LNCS 623, Springer-Verlag, Berlin, 1992, pp. 439-449.
9. Edelsbrunner, H. Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1987.
10. Erickson, J. New lower bounds for Hopcroft's problem, Proc. 11th Ann. ACM Symp. on Computational Geometry, 1995, to appear.
11. Fredman, M. L. A lower bound on the complexity of orthogonal range queries, J. Assoc. Comput. Mach., 28 (1981), 696-705.
12. Fredman, M. L. Lower bounds on the complexity of some optimal data structures, SIAM J. Comput., 10 (1981), 1-10.
13. Lancaster, P., Tismenetsky, M. The Theory of Matrices, 2nd edn., Academic Press, New York, 1985.
14. Matoušek, J. Geometric range searching, Tech. Report B-93-09, Free University Berlin, 1993.
15. Mehlhorn, K. Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry, Springer-Verlag, Heidelberg, 1984.
16. Morgenstern, J. Note on a lower bound of the linear complexity of the fast Fourier transform, J. Assoc. Comput. Mach., 20 (1973), 305-306.
17. Mulmuley, K. Computational Geometry: An Introduction Through Randomized Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1994.
18. Roth, K. F. On irregularities of distribution, Mathematika, 1 (1954), 73-39.
19. Yao, A. C. On the complexity of maintaining partial sums, SIAM J. Comput., 14 (1985), 277-288.
20. Yao, F. F. Computational geometry, in: Algorithms and Complexity, Handbook of Theoretical Computer Science, Vol. A, ed. J. van Leeuwen, Elsevier, Amsterdam, 1990, pp. 343-389.