
MIT OpenCourseWare
A free and open online publication of educational material from thousands of MIT courses, covering the entire MIT curriculum, ranging from introductory to the most advanced graduate courses. On the OCW website, each course includes a syllabus, instructional material like notes and reading lists, and learning activities like assignments and solutions. Some courses also have videos, online textbooks, and faculty insights on teaching. Knowledge is your reward. There's no signup or enrollment, and no start or end dates. OCW is self-paced learning at its best. Whether you’re a student, a teacher, or simply a curious person that wants to learn, MIT OpenCourseWare (OCW) offers a wealth of insight, inspiration, videos, and a whole lot more! Get the full picture on the OCW website at https://ocw.mit.edu. Accessibility: https://accessibility.mit.edu/ User comments policy: https://ocw.mit.edu/comments/ (Channel banner photo by Nietnagel on Flickr: https://flic.kr/p/8WXxfK.)
Episodes


5. Amortization: Amortized Analysis

19. Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees

R5. Dynamic Programming

11. Dynamic Programming: All-Pairs Shortest Paths

17. Complexity: Approximation Algorithms

R8. NP-Complete Problems

8. Randomization: Universal & Perfect Hashing

9. Augmentation: Range Trees

R1. Matrix Multiplication and the Master Theorem

6. Randomization: Matrix Multiply, Quicksort

R4. Randomized Select and Randomized Quicksort

R7. Network Flow and Matching

R11. Cryptography: More Primitives

22. Cryptography: Encryption

R9. Approximation Algorithms: Traveling Salesman Problem

12. Greedy Algorithms: Minimum Spanning Tree

3. Divide & Conquer: FFT

21. Cryptography: Hash Functions

4. Divide & Conquer: van Emde Boas Trees
Follow this podcast in Podwise
Sign in to get AI summaries, transcripts and mind maps for any episode, including new ones.
