On dynamic range reporting in one dimension

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 104-111

  Mortensen, Christian Worm ^a   Pagh, Rasmus ^a   Pǎtraşcu, Mihai ^b  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Bloomier filters; Integer search; Perfect hashing; Range reporting

Indexed keywords

BLOOMIER FILTERS; INTEGER SEARCH; PERFECT HASHING; RANGE REPORTING;

ALGORITHMS; DATA STRUCTURES; INTEGER PROGRAMMING; OPTIMAL CONTROL SYSTEMS; RANDOM ACCESS STORAGE; SEARCH ENGINES;

PROBLEM SOLVING;

EID: 34848899253     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060606     Document Type: Conference Paper

References (14)

1. S. Alstrup, G. Brodal, and T. Rauhe. Optimal static range reporting in one dimension. In Proc. 33rd ACM Symposium on Theory of Computing (STOC), pages 476-482, 2001.
2. P. Beame and F. E. Fich. Optimal bounds for the predecessor problem and related problems. Journal of Computer and System Sciences, 65(1):38-72, 2002. See also STOC'99.
3. B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal. The Bloomier filter: an efficient data structure for static support lookup tables. In Proc. 15th ACM/SIAM Symposium on Discrete Algorithms (SODA), pages 30-39, 2004.
4. M. Dietzfelbinger. Universal hashing and k-wise independent random variables via integer arithmetic without primes. In Proc, 13th Symposium on Theoretical Aspects of Computer Science (STAGS), pages 569-580, 1996.
5. M. Dietzfelbinger and F. M. auf der Heide. A new universal class of hash functions and dynamic hashing in real time. In Proc 17th International Colloquium on Automata, Languages and Programming (ICALP), pages 6-19, 1990.
6. M. L. Freclman. The complexity of maintaining an array and computing its partial sums. Journal of the ACM, 29(1):250-260, 1982.
7. M. L. Fredinan and D. E. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences, 47(3):424-436, 1993. See also STOC'90.
8. T. Hagerup. Sorting and searching on the word RAM. In Proc. 15th Symposium on Theoretical Aspects of Computer Science (STAGS), pages 366-398, 1998.
9. 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. See also STOC'95.
10. A. Pagh, R. Pagh, and S. S. Rao. An optimal Bloom filter replacement. In Proc. 16th ACM/SIAM Symposium on Discrete Algorithms (SODA), 2005. To appear.
11. J. P. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. SIAM Journal on Discrete Mathematics, 8(2):223-250, 1995. See also SODA'93.
12. A. Siegel. On universal classes of extremely random constant-time hash functions. SIAM Journal on Computing, 33(3):505-543, 2004.
13. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Mathematical Systems Theory, 10:99-127, 1977. See also FOCS'75.
14. D. E. Willard. Log-logarithmic worst-case range queries are possible in space Θ(N). Information Processing Letters, 17(2):81-84, 1983.