MIT 6.006 Lecture 8: Hashing with Chaining, Simple Uniform Hashing & Universal Families
Rigorous randomized algorithms lecture showing how universal hash functions defeat adversarial key collisions in expected O(1) time.
MIT 6.006 Introduction to Algorithms, Fall 2011
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Erik Demaine
More courses at http://ocw.mit.edu
Previous · Lecture 7
MIT 6.006 Lecture 7: Decision-Tree Ω(n log n) Lower Bound, Counting Sort & Radix Sort
Next · Lecture 9Lecture 9: Table Doubling, Karp-Rabin (6.006)
Comments
Add a comment...Sign in