It is not a published paper, but it appears you did not pay much attention besides 'skimming' through (perhaps not even that). The tl:dr; is that certain non c

It is not a published paper, but it appears you did not pay much attention besides 'skimming' through (perhaps not even that). 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.