Deterministic Dictionaries

Journal of Algorithms

Volumn 41, Issue 1, 2001, Pages 69-85

  Hagerup, Torben ^a   Miltersen, Peter Bro ^b   Pagh, Rasmus ^b  

^a GOETHE UNIVERSITY   (Germany)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

Data structures; Derandomization; Deterministic dictionaries; Error correcting codes; Information retrieval; Perfect hashing; Searching; Word parallelism

Indexed keywords

EID: 0038309345     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1171     Document Type: Article

References (26)

1. N. Alon and M. Naor, Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions, Algorithmica 16 (1996), 434-449.
2. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, Sorting in linear time? J. Comput. System Sci. 57 (1998), 74-93, doi: 10.1006/jcss.1998.1580.
3. 0 RAMs: Query time Θ(√log n/ log log n) is necessary and sufficient, in "Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS '96)," pp. 441-450, IEEE Comput. Soc., Los Alamitos, CA, 1996.
4. A. Andersson and M. Thorup, Tight(er) worst-case bounds on dynamic searching and priority queues, in "Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC '00)," pp. 335-342, Assoc. Comput. Mach., New York, 2000.
5. P. Beame and F. E. Fich, Optimal bounds for the predecessor problem, in "Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC '99)," pp. 295-304, Assoc. Comput. Mach., New York, 1999.
6. A. Brodnik, P. B. Miltersen, and J. I. Munro. Trans-dichotomous algorithms without multiplication - Some upper and lower bounds, in "Proceedings of the 5th International Workshop on Algorithms and Data Structures (WADS '97)," Lecture Notes in Computer Science, Vol. 1272, pp. 426-439, Springer-Verlag, Berlin, 1997.
7. J. L. Carter and M. N. Wegman, Universal classes of hash functions, J. Comput. System Sci. 18 (1979), 143-154.
8. M. Dietzfelbinger, Universal hashing and k-wise independent random variables via integer arithmetic without primes, in "Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS '96)," Lecture Notes in Computer Science, Vol. 1046, pp. 569-580, Springer-Verlag, Berlin, 1996.
9. M. Dietzfelbinger, J. Gil, Y. Matias, and N. Pippenger, Polynomial hash functions are reliable (extended abstract), in "Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP '92)," Lecture Notes in Computer Science, Vol. 623, pp. 235-246, Springer-Verlag, Berlin, 1992.
10. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, Dynamic perfect hashing: Upper and lower bounds, SIAM J. Comput. 23 (1994), 738-761.
11. M. L. Fredman, J. Komlós, and E. Szemerédi, Storing a sparse table with O(1) worst case access time, J. Assoc. Comput. Mach. 31 (1984), 538-544.
12. M. L. Fredman and D. E. Willard, Surpassing the information theoretic bound with fusion trees, J. Comput. System Sci. 47 (1993), 424-436.
13. T. Hagerup, Sorting and searching on the word RAM, in "Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS '98)," Lecture Notes in Computer Science, Vol. 1373, pp. 366-398, Springer-Verlag, Berlin, 1998.
14. 0 RAM, in "Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP '98)," Lecture Notes in Computer Science, Vol. 1443, pp. 79-90, Springer-Verlag, Berlin, 1998.
15. T. Hagerup, Fast deterministic construction of static dictionaries, in "Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '99)," pp. 414-418, Assoc. Comput. Mach., New York, 1999.
16. D. E. Knuth, "The Art of Computer Programming, Vol. 3. Sorting and Searching," Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley, Reading, MA, 1973.
17. F. J. MacWilliams and N. J. A. Sloane, "The Theory of Error-Correcting Codes," Vol. 16, North-Holland Mathematical Library, North-Holland, Amsterdam, 1977.
18. K. Mehlhorn and U. Vishkin, Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories, Acta Inform. 21 (1984), 339-374.
19. P. B. Miltersen, Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries, in "Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '98)," pp. 556-563, Assoc. Comput. Mach., New York, 1998.
20. M. H. Overmars and J. van Leeuwen, Worst-case optimal insertion and deletion methods for decomposable searching problems, Inform. Process. Lett. 12 (1981), 168-173.
21. R. Pagh, Faster deterministic dictionaries, in "Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '00)," pp. 487-493, Assoc. Comput. Mach., New York, 2000.
22. R. Pagh, A trade-off for worst-case efficient dictionaries, Nordic J. Comput. 7 (2000), 151-163.
23. R. Raman, Priority queues: Small, monotone and trans-dichotomous, in "Proceedings of the 4th Annual European Symposium on Algorithms (ESA '96)," Lecture Notes in Computer Science, Vol. 1136, pp. 121-137, Springer-Verlag, Berlin, 1996.
24. R. Sundar, "A Lower Bound on the Cell Probe Complexity of the Dictionary Problem," unpublished manuscript.
25. R. E. Tarjan and A. C.-C. Yao, Storing a sparse table, Comm. Assoc. Comput. Mach., 22 (1979), 606-611.
26. M. N. Wegman and J. L. Carter, New hash functions and their use in authentication and set equality, J. Comput. System Sci. 22 (1981), 265-279.