An overview of practical and provably good hash functions

Pat Morin

In this talk I will discuss some results on universal hashing of integers, objects, and strings that are not as well-known as they should be. These functions are provably good, and very efficient on modern computer hardware; most involve nothing more complicated than fixed-precision addition, multiplication, and shifting.