Journal of the ACM Bibliography
Bernard Chazelle. Lower
bounds for orthogonal range searching II. the arithmetic model.
Journal of the ACM, 37(3):439-463, July 1990.
[BibTeX entry]
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.
- Peter Bro Miltersen. Lower bounds for
Union-Split-Find related problems on random access machines. In
Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory
of Computing, pages 625-634, Montréal, Québec,
Canada, 23-25 May 1994.
- Peter Bro Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson. On data
structures and asymmetric communication complexity. Journal of
Computer and System Sciences, 57(1):37-49, August 1998.
- 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.
Shortcuts: