Uniform deterministic dictionaries

ACM Transactions on Algorithms

Volumn 4, Issue 1, 2008, Pages

  Ružić, Milan ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Deterministic algorithms; Perfect hashing

Indexed keywords

DETERMINISTIC ALGORITHMS; PERFECT HASHING;

COMPUTATION THEORY; FUNCTION EVALUATION; MATHEMATICAL MODELS; PROBLEM SOLVING;

GLOSSARIES;

EID: 42149187711     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1328911.1328912     Document Type: Article

References (21)

1. ALON, N., AND NAOR, M. 1996. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16, 4-5, 434-449.
2. ANDERSSON, A. 1996. Faster deterministic sorting and searching in linear space. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, 135-141.
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). IEEE Computer Society Press, 441-450.
4. ANDERSSON, A., AND THORUP, M. 2000. Tight(er) worst-case bounds on dynamic searching and priority queues. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC). ACM Press, 335-342.
5. BEAME, P., AND FICH, F. E. 2002. Optimal bounds for the predecessor problem and related problems. J. Comput. Syst. Sci. 65, 1, 38-72.
6. CARTER, J. L., AND WEGMAN, M. N. 1979. Universal classes of hash functions. J. Comput. Syst. Sci. 18, 2, 143-154.
7. DIETZFELBINGER, M. 1996. 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). Lecture Notes in Computer Science, vol. 1046. Springer, 569-580.
8. DIETZFELBINGER, M., HAGERUP, T., KATAJAINEN, J., AND PENTTONEN, M. 1997. A reliable randomized algorithm for the closest-pair problem. J. Algor. 25, 1, 19-51.
9. DIETZFELBINGER, M., KARLIN, A. R., MEHLHORN, K., AUF DER HEIDE, F. M., ROHNERT, H., AND TARJAN, R. E. 1994. Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput. 23, 4, 738-761.
10. DIETZFELBINGER, M., GIL, J., MATIAS, Y., AND PIPPENGER, N. 1992. Polynomial hash functions are reliable (extended abstract). In Proceedings of the 19th International Colloquium on Automata, Languages, and Programming (ICALP). Lecture Notes in Computer Science, vol. 623. Springer, 235-246.
11. FREDMAN, M. L., KOMLÓS, J., AND SZEMERÉDI, E. 1984. Storing a sparse table with O(1) worst case access time. J. ACM 31, 3, 538-544.
12. FREDMAN, M. L., AND WILLARD, D. E. 1993. Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci. 47, 3, 424-436.
13. HAGERUP, T. 1998. Sorting and searching on the word RAM. In Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science, vol. 1373. Springer, 366-398.
14. HAGERUP, T., MILTERSEN, P. B., AND PAGH, R. 2001. Deterministic dictionaries. J. Algor. 41, 1, 69-85.
15. KNUTH, D. E. 1973. The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, Reading., MA.
16. MILTERSEN, P. B. 1998. Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries. In Proceedings of the 9th Annual ACMSIAM Symposium on Discrete Algorithms (SODA). ACM Press, 556-563.
17. OVERMARS, M. H., AND VAN LEEUWEN, J. 1981. Worst-Case optimal insertion and deletion methods for decomposable searching problems. Inf. Proc. Lett. 12, 4, 168-173.
18. PAGH, R. 2000. A trade-off for worst-case efficient dictionaries. Nordic J. Comput. 7, 3, 151-163.
19. RAMAN, R. 1996. Priority queues: Small, monotone and trans-dichotomous. In Proceedings of the 4th European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol. 1136. Springer, 121-137.
20. RUŽIĆ, M. 2007. Making deterministic signatures quickly. In Proceedings of the 18th ACM/SIAM Symposium on Discrete Algorithms (SODA). 900-909.
21. TARJAN, R. E., AND YAO, A. C.-C. 1979. Storing a sparse table. Commun. ACM 22, 11, 606-611.