Introduction to Algorithms (MIT 6.046J)

Lectures

Lecture links to the MIT OCW site include the video or audio lecture itself in several formats, along with a transcript and a PDF set of lecture notes.

• Lecture 24: Advanced Topics: Cache-Oblivious Algorithms 1

• Lecture 25: Advanced Topics: Cache-Oblivious Algorithms 2 and Wrap-Up

[Videos embedded below also]

Readings

All readings, unless otherwise specified, are from Introduction to Algorithms, 2nd Edition.

• After Lecture 24:
  • Erik D. Demaine, “Cache-Oblivious Algorithms and Data Structures”, in Lecture Notes from the EEF Summer School on Massive Data Sets, Lecture Notes in Computer Science, BRICS, University of Aarhus, Denmark, June 27–July 1, 2002, to appear. (PDF from Erik Demaine's site.)

Other material

• Optional:
  • Peteris Krumins' comments and lecture notes for Lectures 24 and 25

Assignment Notes

There are no more problem sets for this class. These were the final lectures, and next week's "lesson" is nothing but the final exam. Feel free to move ahead to Week 16 and take the practice test and final when you're ready.

Videos

Lecture 24

Lecture 25