most citedRegular and almost universal hashing: an efficient implementation

3 citations · 3 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2016★ 3 cited

Regular and almost universal hashing: an efficient implementation

Dmytro Ivanchykhin, Sergey Ignatchenko, Daniel Lemire

Random hashing can provide guarantees regarding the performance of data structures such as hash tables---even in an adversarial setting. Many existing families of hash functions ar…