Lecture 8: Universal Hashing, Perfect Hashing
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009, recorded: October 2005, views: 8750
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
"Hashing. Today we're going to do some amazing stuff with hashing. And, really, this is such neat stuff, it's amazing. We're going to start by addressing a fundamental weakness of hashing. And that is that for any choice of hash function There exists a bad set of keys that all hash to the same slot. OK. So you pick a hash function. We looked at some that seem to work well in practice, that are easy to put into your code. But whichever one you pick, there's always some bad set of keys. So you can imagine, just to drive this point home a little bit..."
Download slides: mit6046jf05_leiserson_lec08_01.pdf (221.7 KB)
Download mit6046jf05_leiserson_lec08_01.m4v (Video - generic video source 166.9 MB)
Download mit6046jf05_leiserson_lec08_01.rm (Video - generic video source 127.1 MB)
Download mit6046jf05_leiserson_lec08_01.flv (Video 230.5 MB)
Download mit6046jf05_leiserson_lec08_01.wmv (Video 687.7 MB)
Download mit6046jf05_leiserson_lec08_01.mp3 (Audio lecture 16.7 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !