4 citations · 4 across the 3 of their papers we have counts for
3 papers
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…
Deterministic and Fast Randomized Test-and-Set in Optimal Space
George Giakkoupis, Maryam Helmi, Lisa Higham +1
The test-and-set object is a fundamental synchronization primitive for shared memory systems. A test-and-set object stores a bit, initialized to 0, and supports one operation, test…
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…