Uniform hashing in constant time and optimal space

SIAM Journal on Computing

Volumn 38, Issue 1, 2008, Pages 85-96

  Pagh, Anna ^a   Pagh, Rasmus ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Hash function; Randomized algorithms; Uniform hashing

Indexed keywords

CONTROL THEORY; DATA STRUCTURES; FILE ORGANIZATION; FUNCTIONS; PROBABILITY; RANDOM PROCESSES;

ALGORITHMS AND DATA STRUCTURES; CONSTANT TIMES; HASH FUNCTION; HASH FUNCTIONS; HIGH PROBABILITIES; IDEAL SOLUTIONS; LOWER BOUNDS; POSITIVE CONSTANTS; RANDOM FUNCTIONS; RANDOMIZED ALGORITHMS; UNIFORM HASHING; UNIVERSAL HASH FUNCTIONS;

PROBABILITY DENSITY FUNCTION;

EID: 55249124312     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060658400     Document Type: Article

References (25)

1. M. AGRAWAL, N. KAYAL, AND N. SAXENA, PRIMES is in P, Ann. Math., 160 (2004), pp. 781-793.
2. N. ALON, Eigenvalues and expanders, Combinatorica, 6 (1986), pp. 83-96.
3. N. ALON, L. BABAI, AND A. ITAI, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms, 7 (1986), pp. 567-583.
4. Y. AZAR, A. Z. BRODER, A. R. KARLIN, AND E. UPFAL, Balanced allocations, SIAM J. Comput., 29 (1999), pp. 180-200.
5. M. BELLARE, O. GOLDREICH, AND H. KRAWCZYK, Stateless Evaluation of Pseudorandom Functions: Security Beyond the Birthday Barrier, in Proceedings of 19th Annual International Cryptology Conference (CRYPTO'99), Lecture Notes in Comput. Sci. 1666, Springer Verlag, 1999, pp. 270-287.
6. J. L. CARTER AND M. N. WEGMAN, Universal classes of hash functions, J. Comput. System Sci., 18 (1979), pp. 143-154.
7. B. CHOR, O. GOLDREICH, J. HASTAD, J. FRIEDMAN, S. RUDICH, AND R. SMOLENSKY, The bit extraction problem of t-resilient functions (preliminary version), in Proceedings of the 26th Annual Symposium on Foundations of Computer Science (FOCS '85), IEEE Computer Society Press, 1985, pp. 396-407.
8. M. DIETZFELBINGER, Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic Without Primes, in Proceedings of the 13th Symposium on Theoretical Aspects of Computer Science (STAGS '96), Lecture Notes in Comput. Sci. 1046, Springer Verlag, 1996, pp. 569-580.
9. M. DIETZFELBINGER AND F. MEYER AUF DER HEIDE, A New Universal Class of Hash Functions and. Dynamic Hashing in Real Time, in Proceedings of the 17th International Colloquium on Automata, Languages and Programming (ICALP '90), Lecture Notes in Comput. Sci. 443, Springer Verlag, 1990, pp. 6-19.
10. M. DIETZFELBINGER AND F. MEYER AUF DER HEIDE, High Performance Universal Hashing, with Applications to Shared Memory Simulations, in Data Structures and Efficient Algorithms, Lecture Notes in Comput. Sci. 594, Springer, 1992, pp. 250-269.
11. M. DIETZFELBINGER AND P. WOELFEL, Almost Random Graphs with Simple Hash Functions, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC '03), 2003, pp. 629-638.
12. 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), pp. 538-544.
13. G. GONNET, Handbook of Algorithms and Data Structures, Addison-Wesley, Reading, MA, 1984.
14. D. R. HEATH-BROWN AND H. IWANIEC, On the difference between consecutive primes, Invent. Math., 55 (1979), pp. 49-69.
15. S. JANSON, Large Deviation Inequalities for Sums of Indicator Variables, Tech. report 34, Department of Mathematics, Uppsala University, 1993.
16. D. E. KNUTH, Sorting and Searching, 2nd ed., Art of Computer Programming 3, Addison-Wesley, Reading, MA, 1998.
17. A. ÖSTLIN AND R. PAGH, Uniform hashing in constant time and linear space, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC '03), ACM Press, 2003, pp. 622-628.
18. R. PAGH, Dispersing hash functions, in Proceedings of the 4th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM '00), Proc. Informatics 8, Carleton Scientific, 2000, pp. 53-67.
19. R. PAGH AND F. F. RODLER, Cuckoo hashing, J. Algorithms, 51 (2004), pp. 122-144.
20. J. P. SCHMIDT AND A. SIEGEL, On aspects of universality and performance for closed hashing (extended abstract), in Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC '89), ACM Press, 1989, pp. 355-366.
21. J. P. SCHMIDT AND A. SIEGEL, The analysis of closed hashing under limited randomness (extended abstract), in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC '90), ACM Press, 1990, pp. 224-234.
22. J. P. SCHMIDT, A. SIEGEL, AND A. SRINIVASAN, Chernoff-Hoeffding bounds for applications with limited independence, SIAM J. Discrete Math., 8 (1995), pp. 223-250.
23. A. SIEGEL, On universal classes of extremely random constant-time hash functions, SIAM J. Comput., 33 (2004), pp. 505-543.
24. B. VÖCKING, How asymmetry helps load balancing, J. Assoc. Comput. Mach., 50 (2003), pp. 568-589.
25. M. N. WEGMAN AND J. L. CARTER, New hash functions and their use in authentication and set equality, J. Comput. System Sci., 22 (1981), pp. 265-279.