14 citations · 18 across the 3 of their papers we have counts for
2 papers
cs.DS2016★ 4 cited
A Simple Hash Class with Strong Randomness Properties in Graphs and Hypergraphs
Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel
We study randomness properties of graphs and hypergraphs generated by simple hash functions. Several hashing applications can be analyzed by studying the structure of -uniform r…
cs.DS2012
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash
Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel
It is shown that for cuckoo hashing with a stash as proposed by Kirsch, Mitzenmacher, and Wieder (2008) families of very simple hash functions can be used, maintaining the favorabl…