Thursday (December 5) we will have the second of two lectures on hashing. This one is by Sarah Bargal and will include:

- Weakness of Hashing - introducing the problem Universal Hashing solves
- Universal Hashing
- Constructing a Universal Set of Hash Functions
- Example showing an application of Universal Hashing
- Introduction to Perfect Hashing

These are some suggested materials:

-CLRS- Chapter 11
-Prof. Charles E. Leiserson Lecture Slides
http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/vi
deo-lectures/lecture-8-universal-hashing-perfect-hashing/lec8.pdf [ocw.mit.edu]
-Video from Stanford University by Tim Roughgarden
https://class.coursera.org/algo-004/lecture/68 [class.coursera.org]