Lecture 25: Advanced Topics (cont.), Discussion of Follow-on Classes
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009, recorded: December 2005, views: 1035
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Download mit6046jf05_demaine_lec25_01.m4v (Video - generic video source 178.9 MB)
Download mit6046jf05_demaine_lec25_01.rm (Video - generic video source 136.5 MB)
Download mit6046jf05_demaine_lec25_01.flv (Video 235.8 MB)
Download mit6046jf05_demaine_lec25_01.wmv (Video 748.7 MB)
Download mit6046jf05_demaine_lec25_01.mp3 (Audio lecture 19.7 MB)
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.
"The last lecture of 6.046. We are here today to talk more about cache oblivious algorithms. Last class, we saw several cache oblivious algorithms, although none of them quite too difficult. Today we will see two difficult cache oblivious algorithms, a little bit more advanced. I figure we should do something advanced for the last class just to get to some exciting climax. So without further ado, let's get started. Last time, we looked at the binary search problem...
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !