Almost random graphs with simple hash functions

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 629-638

  Dietzfelbinger, Martin ^a   Woelfel, Philipp ^b  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Cuckoo hashing; Hash function; Random graphs; Uniform hashing

Indexed keywords

COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; FUNCTIONS; SET THEORY;

HASH FUNCTIONS;

GRAPH THEORY;

EID: 0038446821     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780632.780634     Document Type: Conference Paper

References (24)

1. B. Bollobás. Random Graphs. Academic Press, London, 1985.
2. J. L. Carter and M . N. Wegman. Universal classes of hash functions. J. Comput. Syst. Sci., 18:143-154, 1979.
3. R. Diestel. Graph Theory. Springer-Verlag, New York, 1997.
4. M. Dietzfelbinger. Universal hashing and k-wise independent random variables via integer arithmetic without primes. In Proc. of 13th STAGS, vol. 1046 of LNCS, pp. 569-580, 1996.
5. M. Dietzfelbinger, Y. Gil, Y. Matias, and N. Pippenger. Polynomial hash functions are reliable. In Proc. of 19th ICALP, vol. 623 of LNCS, pp. 235-246, 1992.
6. M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen. A reliable randomized algorithm for the closest-pair problem. J. Algorithms, 25:19-51, 1997.
7. M. Dietzfelbinger and F. Meyer auf der Heide. Dynamic hashing in real time. In J. Buchmann, H. Ganzinger, and W. J. Paul, editors, Informatik - Festschrift zum 60. Geburtstag von Günter Hotz, pp. 95-119, 1992.
8. 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:738-761, 1994.
9. E. A. Fox, L. S. Heath, Q. F. Chen, and A. M. Daoud. Practical minimal perfect hash functions for large databases. Comm. ACM 35(1):105-121, 1992.
10. D. Fotakis, R. Pagh, P. Sanders, and P. Spirakis. Space efficient hash tables with worst case constant access time. In Proc. of 20th STACS, vol. 2607 of LNCS, pp. 271-282, 2003.
11. R. M. Karp, M. Luby, and F. Meyer auf der Heide. Efficient PRAM simulation on a distributed memory machine. Algorithmica, 16:517-542, 1996.
12. G. S. Lueker and M. Molodowitch. More analysis of double hashing. Combinatorica, 13:83-96, 1993.
13. B. S. Majewski, N. C. Wormald, G. Havas, and Z. J. Czech. A family of perfect hashing methods. The Computer Journal, 39(6): 547-554, 1996.
14. F. Meyer auf der Heide, C. Scheideier, and V. Stemann. Exploiting storage redundancy to speed up shared memory simulations. Theoret. Comput. Sci., 162:245-281, 1996.
15. A. Östlin and R. Pagh. Simulating uniform hashing in constant time and optimal space. Research report RS-02-27, BRICS, Department of Computer Science, University of Aarhus, 2002.
16. A. Östlin and R. Pagh. Uniform hashing in constant time and linear space. In Proc. of 35th ACM STOC (these proceedings'), 2003.
17. R. Pagh. Hash and displace: Efficient evaluation of minimal perfect hash functions. In Proc. of 6th WADS, vol. 1663 of LNCS, pp. 49-54, 1999.
18. R. Pagh. On the cell probe complexity of membership and perfect hashing. In Proc. of 33rd ACM STOC, pp. 425-432, 2001.
19. R. Pagh and F. F. Rodler. Cuckoo hashing. In Proc. of 9th ESA, vol. 2161 of LNCS, pp. 121-133, 2001. Expanded manuscript at http://www.it-c.dk/people/pagh/papers.html.
20. J. P. Schmidt and A. Siegel. The analysis of closed hashing under limited randomness. In Proc. of 22nd ACM STOC, pp. 224-234, 1990.
21. J. P. Schmidt and A. Siegel. Closed hashing is computable and optimally randomizable with universal hash functions. Technical Report, TR1995-687, Courant Institute, New York University, 1995.
22. A. Siegel. On universal classes of fast high performance hash functions, their time-space trade-off, and their applications. In Proc. of 30th IEEE FOCS, pp. 20-25, 1989.
23. A. Siegel. On universal classes of extremely random constant time hash functions and their time-space tradeoff. Technical Report TR1995-684, Courant Institute, New York University, April 1995.
24. M. N. Wegman and J. L. Carter. New classes and applications of hash functions. In Proc. of 20th IEEE FOCS, pp. 175-182, 1979.