On universal classes of extremely random constant-time hash functions

SIAM Journal on Computing

Volumn 33, Issue 3, 2004, Pages 505-543

  Siegel, Alan ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

Hash functions; Hashing; Limited independence; Optimal speedup; PRAM emulation; Storage time tradeoff; Universal hash functions

Indexed keywords

HASH FUNCTIONS; HASHING; LIMITED INDEPENDENCE; OPTIMAL SPEEDUP; PRAM EMULATION; STORAGE-TIME TRADEOFF; UNIVERSAL HASH FUNCTIONS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LINEAR SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

COMPUTATIONAL METHODS;

EID: 3142708934     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701386216     Document Type: Article

References (37)

1. A.V. AHO, J.E. HOPCROFT, AND J.D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. R. ALELIUNAS, Randomized parallel communication, in Proceedings of the 13th ACM-SIGOPS Symposium on Principles of Distributed Computing, 1982, pp. 60-72.
3. C.H. BENNETT, F. BESSETTE, G. BRASSARD, L. SALVAIL, AND J. SMOLIN, Experimental quantum cryptography, J. Cryptology, 5 (1992), pp. 3-28.
4. M. CAPALBO, O. REINGOLD, S. VADHAN, AND A. WIGDERSON, Randomness conductors and constant-degree expansion beyond the degree/2 barrier, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 659-668.
5. J.L. CARTER AND M.N. WEGMAN, Universal classes of hash functions, J. Comput. System Sci., 18 (1979), pp. 143-154.
6. A. CHIN, Locality-preserving hash functions for general purpose, parallel computation, Algorithmica, 12 (1994), pp. 170-181.
7. 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), pp. 738-761.
8. M.L. FREDMAN, J. KOMLÓS, AND E. SZEMERÉDI, Storing a sparse table with O(1) worst case access time, J. ACM, 31 (1984), pp. 538-544.
9. L.A. GOLDBERO, Y. MATIAS, AND S. RAO, An optical simulation of shared memory, SIAM J. Comput., 28 (1999), pp. 1829-1847.
10. A. KARLIN AND E. UPFAL, Parallel hashing: An efficient implementation of shared memory, J. ACM, 35 (1988), pp. 876-892.
11. R. KARP, M. LUBY, AND F. MEYER AUF DER HEIDE, Efficient PRAM simulation on a distributed memory machine, Algorithmica, 16 (1996), pp. 517-542.
12. D.E. KNUTH, The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd ed., Addison-Wesley, Reading, MA, 1998.
13. C.P. KRUSKAL, L. RUDOLPH, AND M. SNIR, A complexity theory of efficient parallel algorithms, Theoret. Comput. Sci., 71 (1990), pp. 95-132.
14. C.-J. Lu, O. REINGOLD, S. VADHANM, AND A. WIGDERSON, Extractors: Optimal up to constant factors, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 602-611.
15. G.S. LUEKER AND M. MOLODOWITCH, More analysis of double hashing, Combinatorica, 13 (1993), pp. 83-96.
16. Y. MATIAS AND A. SCHUSTER, Fast, efficient mutual and self simulations for shared memory and reconfigurable mesh, Parallel Algorithms Appl., Special Issue on Algorithms for Enhanced Mesh Architectures, 8 (1996), pp. 195-221.
17. K. MEHLHORN, Data Structures and Efficient Algorithms 1: Sorting and Searching, Springer-Verlag, Berlin, Heidelberg, 1984.
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), pp. 339-374.
19. N. PIPPENGER, Parallel communication with limited buffers, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1984, pp. 127-136.
20. A.G. RANADE, How to emulate shared memory, J. Comput. System Sci., 42 (1991), pp. 307-326.
21. O. REINGOLD, S. VADHAN, AND A. WIGDERSON, Entropy waves, the zig-zag graph product, and new constant-degree expanders, Ann. of Math. (2), 155 (2002), pp. 157-187.
22. J.P. SCHMIDT AND A. SIEGEL, The analysis of closed hashing under limited randomness, in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990, pp. 224-234.
23. J.P. SCHMIDT AND A. SIEGEL, Double Hashing Is Computable and Randomizable with Universal Hash Functions, SIAM J. Comput., submitted.
24. J.P. SCHMIDT, A. SIEGEL, AND A. SRINIVASAN, Chernoff-Hoeffding bounds for applications with limited independence, SIAM J. Discr. Math., 8 (1995), pp. 223-250.
25. A. SIEGEL AND J.P. SCHMIDT, Closed Hashing Is Computable and Optimally Randomizable with Universal Hash Functions, SIAM J. Comput., submitted.
26. A. SIEGEL, On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications, in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 20-25.
27. A. SIEGEL, Median bounds and their application, J. Algorithms, 38 (2001), pp. 184-236.
28. B. SMITH, A pipelined, shared resource MIMD computer, in Proceedings of the International Conference on Parallel Processing, International Association for Computers and Communications, 1978, pp. 6-8.
29. J. SPENCER, Ten Lectures on the Probabilistic Method, 2nd ed., CBMS-NSF Regional Conf. Ser. in Appl. Math. 64, SIAM, Philadelphia, 1994.
30. E. UPFAL, Efficient schemes for parallel computation, J. ACM, 31 (1984), pp. 507-517.
31. E. UPFAL, A probabilistic relation between desirable and feasible models of parallel computation, in Proceedings of the 16th Annual ACM Symposium on Theory of Computing, 1984, pp. 258-265.
32. E. UPFAL AND A. WIGDERSON, How to share memory in a distributed system, J. ACM, 34 (1987), pp. 116-127.
33. L.G. VALIANT AND G.J. BREBNER, Universal schemes for parallel communication, in Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981, pp. 263-277.
34. L.G. VALIANT, Optimally universal parallel computers, Phil, Trans. Royal Soc. London Ser. A, 326 (1988), pp. 373-376.
35. L.G. VALIANT, General purpose parallel architectures, in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, ed., Elsevier, Amsterdam, 1990, pp. 943-972.
36. 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.
37. A.C. YAO, Uniform hashing is optimal, J. ACM, 32 (1985), pp. 687-693.