Almost random graphs with simple hash functions

  title={Almost random graphs with simple hash functions},
  author={Martin Dietzfelbinger and Philipp Woelfel},
We describe a simple randomized construction for generating pairs of hash functions h1,h2 from a universe U to ranges V = [m] = (0,1,...,m-1) and W = [m] so that for every key set S ⊆ U with n = |S| ≤ m/(1 + ε) the (random) bipartite (multi)graph with node set V ∪ W and edge set (h1(x),h2(x))| x ∈ S exhibits a structure that is essentially random. The construction combines d-wise independent classes for d a relatively small constant with the well-known technique of random offsets. While keeping… CONTINUE READING
Highly Cited
This paper has 67 citations. REVIEW CITATIONS


Publications citing this paper.

68 Citations

Citations per Year
Semantic Scholar estimates that this publication has 68 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-6 of 6 references

Simulating uniform hashing in constant time and optimal space

  • A. Östlin, R. Pagh
  • Research report RS-02-27, BRICS, Department of…
  • 2002
Highly Influential
19 Excerpts

and F

  • R. M. Karp, M. Luby
  • Meyer auf der Heide. Efficient PRAM simulation on…
  • 1996
Highly Influential
7 Excerpts


  • M. Dietzfelbinger, Y. Gil
  • Matias, and N .Pippenger. Polynomial hash…
  • 1992
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…