Lower bounds for 2-dimensional range counting

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 40-46

  Pǎtraşcu, Mihai ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Cell probe complexity; Lower bounds; Orthogonal range queries

Indexed keywords

CELL-PROBE COMPLEXITY; LOWER BOUNDS;

DATA STRUCTURES; DYNAMIC PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

BOUNDARY CONDITIONS;

EID: 35448960382     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250797     Document Type: Conference Paper

References (18)

1. P. K. Agarwal. Range searching. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry (2nd edition). Chapman & Hall/CRC, 2004.
2. B. Chazelle. Lower bounds for orthogonal range searching II. The arithmetic model. Journal of the ACM, 37(3):439-463, 1990.
3. See also FOCS'86.
4. B. Chazelle. Lower bounds for off-line range searching. Discrete & Computational Geometry, 17(1):53-65, 1997.
5. See also STOC'95.
6. M. L. Fredman. A lower bound on the complexity of orthogonal range queries. Journal of the ACM, 28:696-705, 1981.
7. M. L. Fredman. The complexity of maintaining an array and computing its partial sums. Journal of the ACM, 29(1):250-260, 1982.
8. M. L. Fredman and M. E. Saks. The cell probe complexity of dynamic data structures. In Proc. 21st ACM Symposium on Theory of Computing (STOC), pages 345-354, 1989.
9. H. Hampapuram and M. L. Fredman. Optimal biweighted binary trees and the complexity of maintaining partial sums. SIAM Journal on Computing, 28(1):1-9, 1998.
10. See also FOCS'93.
11. P. B. Miltersen, N. Nisan, S. Safra, and A. Wigderson. On data structures and asymmetric communication complexity. Journal of Computer and System Sciences, 57(1):37-49, 1998.
12. See also STOC'95.
13. M. Pãtraşcu and E. D. Demaine. Logarithmic lower bounds in the cell-probe model. SIAM Journal on Computing, 35(4):932-963, 2006.
14. See also SODA'04 and STOC'04.
15. M. Pãtraşcu and M. Thorup. Higher lower bounds for near-neighbor and further rich problems. In Proc. 47th IEEE Symposium on Foundations of Computer Science (FOCS), pages 646-654, 2006.
16. M. Pãtraşcu and M. Thorup. Time-space trade-offs for predecessor search. In Proc. 38th ACM Symposium on Theory of Computing (STOC), pages 232-240, 2006.
17. M. Pãtraşcu and M. Thorup. Randomization does not help searching predecessors. In Proc. 18th ACM/SIAM Symposium on Discrete Algorithms (SODA), pages 555-564, 2007.
18. A. C.-C. Yao. On the complexity of maintaining partial sums. SIAM Journal on Computing, 14:277-288, 1985.