1. Course Overview, Interval Scheduling6.046J · Lec 1 · Erik Demaine & Srini Devadas · MITErik Demaine & Srini DevadasMIT1:23:34
How Hard is too Hard? An Introduction to ComplexityTheory & Algos·Public Colloquium · Colva Roney-Dougal · Gresham CollegeColva Roney-DougalGresham College22 ch44:23
All Non-Trivial Variants of 3-LDTTheory & Algos·Research Seminar · B. Dudek & P. Gawrychowski · University of WrocławB. Dudek & P. GawrychowskiUniversity of Wrocław21:57
Divide and Conquer Recurrences (MIT 6.042J, Lecture 14)6.042J · Lec 14 · Tom Leighton · MITTom LeightonMIT1:22:46
R2. 2-3 Trees and B-Trees6.046J · Lec 5 · Erik Demaine & Srini Devadas · MITErik Demaine & Srini DevadasMIT30:45
Lecture 12: Square Roots, Newton's Method (6.006)6.006 · Lec 12 · Srini Devadas · MITSrini DevadasMIT51:17
Lecture 11: Integer Arithmetic, Karatsuba Multiplication (6.006)6.006 · Lec 11 · Srini Devadas · MITSrini DevadasMIT47:24
Lecture 6c: The Word RAM Model (15-750)15-750 · Lec 18 · Ryan O'Donnell · Carnegie Mellon UniversityRyan O'DonnellCarnegie Mellon University25:30