For not entirely clear reasons (maybe multiplier selection?), only Knuth's modulo prime suggestion "propagated" well in the 70s and 80s. This suggestion reception bias also aged poorly over ensuing decades with the CPU cost of modulo vs. multiply evolving from a 2x performance delta to more like 10x.
Some of the most practical hash functions have only appeared in theory papers, and some of them requires combining results from different theory papers. The goal here is to combine the information in lecture-style notes that can be used by theoreticians and practitioners alike, thus making these practical fruits of theory more widely accessible.
Reviews are pretty common and while they might seem trivial, writing a good one is an astonishing amount of work.
The tl:dr; is that certain non cryptographic hash functions provide certain guarantees in different applications such as signatures, expected runtimes on hashmaps, distributed sampling and so on, it also shows some fast solutions with good guarantees and explains the mathematics behind said guarantees.
The professor mentions in the document that the document exists because modern textbooks do not go into detail on hashing.
The content in the document is sufficient for 1 or 2 lectures on introduction to hashing. We spent 1 lecture during a graduate course in Advanced Algorithms and Data-structures.
This is a good survey paper about the old, known, fast, simple one-line hashes. I've tested all of them in smhasher also. They are all *not* recommended for production use.