Linear Hash Functions

Journal of the ACM

Volumn 46, Issue 5, 1999, Pages 667-683

  Alon, Noga ^a,d,g   Dietzfelbinger, Martin ^b,c,d   Miltersen, Peter Bro ^d,e,f   Petrank, Erez ^a,b,c   Tardos, Gábor ^d,e,g  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^d AARHUS UNIVERSITY   (Denmark)

^e TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^f Institute of Mathematics   (Hungary)

^g INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Hashing via linear maps; Universal hashing

Indexed keywords

HASHING VIA LINEAR MAPS; MULTI-SETS; OCCUPANCY THEORY; UNIVERSAL HASHING;

ALGORITHMS; PROBABILITY; PROBLEM SOLVING; PROJECT MANAGEMENT; RANDOM PROCESSES; RESEARCH;

FUNCTIONS;

EID: 0000694935     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/324133.324179     Document Type: Article

References (17)

1. ALON, N., BABAI, L, AND ITAI, A. 1986. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7, 567-583.
2. ANDERSSON, A., HAGERUP, T., NILSSON, S., RAMAN, R. 1995. Sorting in linear time? In Proceedings of the 27th ACM Symposium on Theory of Computing (Las Vegas, Nev., May 29-June 1). ACM, New York, pp. 427-436.
3. CARTER, J. L., WEGMAN, M. N. 1979. Universal classes of hash functions. J. Compiit. Syst. Sei. 18, 143-154.
4. CORMEN, T. H., LEISERSON, C. E., RIVEST, R. L. 1990. Introduction to Algorithms. MIT Press, Cambridge, Mass.
5. DIETZFELBINGER, M., GIL, J., MATIAS, Y., PlPPENGER, N. 1992. Polynomial hash functions are reliable. Proceedings of ICALP'92. Lecture Notes in Computer Science, Vol. 623. Springer-Verlag, New York, pp. 235-246.
6. DIETZFELBINGER, M., HAGERUP, T., KATAJAINEN, J., PENTTONEN, M. 1997. A reliable randomized algorithm for the closest-pair problem. J. Algorithms 25, 19-51.
7. DIETZFELBINGER, M., KARLIN, A., MEHLHORN, K., MEYER AUF DER HEIDE, F., ROHNERT, H., TARJAN, R. E. 1994. Dynamic perfect hashing: upper and lower bounds. SIAM J. Comput. 23, 738-761.
8. DIETZFELBINGER, M., MEYER AUF DER HEIDE, F. 1992. Dynamic hashing in real time. In Informatik-Festschrift zum 60. Geburt-stag von Günter Holz., J. Buchmann, H. Ganzinger, W. J. Paul, eds. Teubner-Texte zur Informatik, Band l, B. G. Teubner. pp. 95-119.
9. FREDMAN, M. L., KOMLOS, J., SZEMEREDI, E. 1984. Storing a sparse table with 0(1) worst case access time. J. A. C. M. 31, 3 (July), 538-544.
10. GÖNNET, G., BAEZA-YATES, R. 1991. Handbook of Algorithms and Data Structures. Addison-Wesley, Reading, Mass.
11. GRAHAM, S. \V., RINGROSE, C. J. 1990. Lower bounds for least quadratic nonresidues. In Analytic Number Theory: Proceedings of a Conference in Honor of P.T. Bateman. B. C. Berndt et al., eds., Birkhäuser, Boston.
12. MANSOUR, Y., NISAN, N., TIWARI, P. 1993. The computational complexity of universal hashing. Theoret. Comput. Sei. 107, 121-133.
13. MARKOWSKY, G., CARTER, J. L., WEGMAN, M. N. 1978. Analysis of a universal class of hash functions. In Proceedings of the 7th Conference on Mathematical Foundations of Computer Science (MFCS). Lecture Notes in Computer Science, Vol. 64, Springer-Verlag, New York, pp. 345-354.
14. MEHLHORN, K., VISHKIN, U. 1984. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Inf. 21, 339-374.
15. PACH, J., AGARWAL, P. K. 1995. Combinatorial Geometry. Wiley, New York.
16. SIEGEL, A. 1989. On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 20-25.
17. VAPNIK, V. A., CHERVONENKIS, A. Y. 1971. On the uniform convergence of relative frequencies of events to their probabilities. Tlieory Prob. Appl. 16, 264-280.