Universal hashing and k-wise independent random variables via integer arithmetic without primes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1046, Issue , 1996, Pages 567-580

  Dietzfelbinger, Martin ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS; RANDOM VARIABLES;

ARBITRARY INTEGER; AVAILABLE OPERATION; DISTINCT ELEMENTS; INDEPENDENT RANDOM VARIABLES; INTEGER ARITHMETIC; PERFECT HASHING; PROBABILITY SPACES; UNIVERSAL HASHING;

C (PROGRAMMING LANGUAGE);

EID: 84941339354     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_46     Document Type: Conference Paper

References (27)

1. K. Abrahamson. Time-space tradeoffs for branching programs contrasted with those for straight-line programs. In Proc. of the 27th IEEE FOCS, pp. 402-409, 1986.
2. N.Alon, O. Goldreich, J. Håstad, and R. Peralta. Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms, 3:289-304, 1992.
3. N.Alon, O. Goldreich, J. Håstad, and R. Peralta. Addendum to "simple constructions of almost k-wise independent random variables". Random Structures and Algorithms, 4(1):119-120, 1993.
4. P. Beame, S. A. Cook, and H. J. Hoover. Log depth circuits for division and related problems. SIAM J. Comput., 15(4):994-1003, 1986.
5. B.Chor and O. Goldreich. On the power of two-point based sampling. J. of Complexity, 5:96-106, 1989.
6. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, Mass., 1990.
7. J. L. Carter and M. N. Wegman. Universal classes of hash functions. J. Comp. Syst. Sci., 18:143-154, 1979.
8. M. Dietzfelbinger, J. Gil, Y. Matias, and N.Pippenger. Polynomial hash functions are reliable. In W. Kuich, editor, Proceedings of 19th 1CALP, pp. 235-246. Springer-Verlag, LNCS 623, 1992.
9. M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M.Penttonen. A reliable randomized algorithm for the closest-pair problem. Research Report 513, Universität Dortmund, December 1993.
10. 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(4):738-761, 1994.
11. 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. Ge-burtstag von Günter Hotz, volume 1 of Teubner-Ťexte zur Informatik. B. G. Teubner, Stuttgart-Leipzig, 1992.
12. M.L.Fredman, J.Komlós, and E.Szemerédi. Storing a sparse table with 0(1) worst case access time. J. Assoc. Comput. Mach., 31(3):538-544, July 1984.
13. G. H. Hardy, and E. M. Wright. An Introduction to the Theory of Numbers. Oxford Science Publications, Clarendon Press, Oxford, 1994.
14. R. M. Karp and A. Wigderson. A fast parallel algorithm for the maximal independent set problem. J. Assoc. Comput. Mach., 32(4):762-773, 1985.
15. N. Linial, M. Luby, M. Saks, and D. Zuckerman. Efficient construction of a small hitting set for combinatorial rectangles in high dimension. In Proc. of the 24th ACM STOC, pp. 258-267 1993.
16. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15:1036-1053, 1986.
17. K. Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching. Springer-Verlag, Berlin, 1984.
18. Y. Mansour, N. Nisan, and P. Tiwari. The computational complexity of universal hashing. Theoretical Computer Science, 107:121-133, 1993.
19. K. Mehlhorn and U.Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica, 21:339-374, 1984.
20. Y. Matias and U.Vishkin. On parallel hashing and integer sorting. J. Algorithms, 12:573-606, 1991.
21. N. Nisan. Pseudorandom generators for space-bounded computations. In Proc. of the 22nd ACM STOC, pp. 204-212, 1990.
22. J. Naor and M. Naor. Small-bias probabilitiy spaces: Efficient constructions and applies tions. In Proc. of the 22nd ACM STOC, pp. 213-223, 1990.
23. A. Siegel. On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications. In Proc. of the 30th IEEE FOCS, pp. 20-25, 1989. Revised Version.
24. A. Schönhage and V. Strassen. Schnelle Multiplikation grosser Zahlen. Computing, 7:281-292, 1971.
25. M. N. Wegman and J.L. Carter. New classes and applications of hash functions. In Proc. of 20th IEEE FOCS, pp. 175-182, 1979.
26. A. Wigderson and O. Goldreich. Tiny families of functions with random properties: A quality-size trade-off for hashing. In Proc. of 26th ACM STOC, pp. 574-583, 1994.
27. A. Wigderson. The amazing power of pairwise independence. In Proc. 26th ACM STOC. pp. 645-647, 1994. (Invited lecture).