Hashing is an incredibly common concept that pops up in the study of data structures and algorithms. Hash tables are quite popular for their applications in problems that require computational efficiency and fast lookups. Hash tables are used to implement caches, and memory efficient structures. The attached lecture slides reflect on the various concepts and techniques of hashing. In particular, separate chaining and open addressing are allocated more focus. Two interesting applications of hashing are also discussed. The first one is about how dropbox prevents itself from sharing copyrighted stuff without actually look at the stuff. This is accomplished through hashing. The other one is from the domain of symbolic regression. In this paper Maarten Keijzer proposes a technique to store GP trees in a subtree cache for faster lookups.

Hashing and Hash Tables from Adil Raja

  by  mikecogh