Design and Analysis of Algorithms (2015)

Design and Analysis of Algorithms (2015)

39 episodes

6.046 introduces students to the design of computer algorithms, as well as analysis of sophisticated algorithms. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Podcasts

Lecture 24: Cache-Oblivious Algorithms: Searching & Sorting

Published: Jan. 3, 2017, 8:39 a.m.
Duration: 1 hour 17 minutes 41 seconds

Listed in: Technology

Lecture 23: Cache-Oblivious Algorithms: Medians & Matrices

Published: Jan. 3, 2017, 8:38 a.m.
Duration: 1 hour 20 minutes 27 seconds

Listed in: Technology

Recitation 11: Cryptography: More Primitives

Published: Jan. 3, 2017, 8:37 a.m.
Duration: 49 minutes 30 seconds

Listed in: Technology

Lecture 22: Cryptography: Encryption

Published: Jan. 3, 2017, 8:36 a.m.
Duration: 1 hour 24 minutes 14 seconds

Listed in: Technology

Lecture 21: Cryptography: Hash Functions

Published: Jan. 3, 2017, 8:35 a.m.
Duration: 1 hour 22 minutes

Listed in: Technology

Recitation 10: Distributed Algorithms

Published: Jan. 3, 2017, 8:34 a.m.
Duration: 50 minutes 18 seconds

Listed in: Technology

Lecture 20: Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees

Published: Jan. 3, 2017, 8:33 a.m.
Duration: 1 hour 12 minutes 3 seconds

Listed in: Technology

Lecture 19: Synchronous Distributed Algorithms: Symmetry-Breaking

Published: Jan. 3, 2017, 8:32 a.m.
Duration: 1 hour 17 minutes 33 seconds

Listed in: Technology

Recitation 9: Approximation Algorithms: Traveling Salesman Problem

Published: Jan. 3, 2017, 8:31 a.m.
Duration: 31 minutes 59 seconds

Listed in: Technology

Lecture 18: Complexity: Fixed-Parameter Algorithms

Published: Jan. 3, 2017, 8:30 a.m.
Duration: 1 hour 17 minutes 43 seconds

Listed in: Technology

Lecture 17: Complexity: Approximation Algorithms

Published: Jan. 3, 2017, 8:29 a.m.
Duration: 1 hour 21 minutes 8 seconds

Listed in: Technology

Recitation 8: NP-Complete Problems

Published: Jan. 3, 2017, 8:28 a.m.
Duration: 45 minutes 46 seconds

Listed in: Technology

Lecture 16: Complexity: P, NP, NP-completeness, Reductions

Published: Jan. 3, 2017, 8:27 a.m.
Duration: 1 hour 25 minutes 25 seconds

Listed in: Technology

Lecture 15: Linear Programming: LP, reductions, Simplex

Published: Jan. 3, 2017, 8:26 a.m.
Duration: 1 hour 22 minutes 27 seconds

Listed in: Technology

Recitation 7: Network Flow and Matching

Published: Jan. 3, 2017, 8:25 a.m.
Duration: 51 minutes 12 seconds

Listed in: Technology

Lecture 14: Incremental Improvement: Matching

Published: Jan. 3, 2017, 8:24 a.m.
Duration: 1 hour 22 minutes 32 seconds

Listed in: Technology

Lecture 13: Incremental Improvement: Max Flow, Min Cut

Published: Jan. 3, 2017, 8:23 a.m.
Duration: 1 hour 22 minutes 57 seconds

Listed in: Technology

Recitation 6: Greedy Algorithms

Published: Jan. 3, 2017, 8:22 a.m.
Duration: 22 minutes 24 seconds

Listed in: Technology

Lecture 12: Greedy Algorithms: Minimum Spanning Tree

Published: Jan. 3, 2017, 8:21 a.m.
Duration: 1 hour 22 minutes 9 seconds

Listed in: Technology

Lecture 11: Dynamic Programming: All-Pairs Shortest Paths

Published: Jan. 3, 2017, 8:20 a.m.
Duration: 1 hour 21 minutes 49 seconds

Listed in: Technology

Lecture 10: Dynamic Programming: Advanced DP

Published: Jan. 3, 2017, 8:19 a.m.
Duration: 1 hour 20 minutes 7 seconds

Listed in: Technology

Lecture 9: Augmentation: Range Trees

Published: Jan. 3, 2017, 8:18 a.m.
Duration: 1 hour 24 minutes 35 seconds

Listed in: Technology

Recitation 5: Dynamic Programming

Published: Jan. 3, 2017, 8:17 a.m.
Duration: 52 minutes 2 seconds

Listed in: Technology

Lecture 8: Randomization: Universal & Perfect Hashing

Published: Jan. 3, 2017, 8:16 a.m.
Duration: 1 hour 21 minutes 51 seconds

Listed in: Technology

Lecture 7: Randomization: Skip Lists

Published: Jan. 3, 2017, 8:15 a.m.
Duration: 1 hour 20 minutes 55 seconds

Listed in: Technology

Recitation 4: Randomized Select and Randomized Quicksort

Published: Jan. 3, 2017, 8:14 a.m.
Duration: 39 minutes 29 seconds

Listed in: Technology

Lecture 6: Randomization: Matrix Multiply, Quicksort

Published: Jan. 3, 2017, 8:13 a.m.
Duration: 1 hour 21 minutes 52 seconds

Listed in: Technology

Lecture 5: Amortization: Amortized Analysis

Published: Jan. 3, 2017, 8:12 a.m.
Duration: 1 hour 15 minutes 53 seconds

Listed in: Technology

Lecture 4: Divide & Conquer: van Emde Boas Trees

Published: Jan. 3, 2017, 8:11 a.m.
Duration: 1 hour 20 minutes 14 seconds

Listed in: Technology

Recitation 2: 2-3 Trees and B-Trees

Published: Jan. 3, 2017, 8:10 a.m.
Duration: 30 minutes 45 seconds

Listed in: Technology

Lecture 3: Divide & Conquer: FFT

Published: Jan. 3, 2017, 8:09 a.m.
Duration: 1 hour 20 minutes 52 seconds

Listed in: Technology

Recitation 1: Matrix Multiplication and the Master Theorem

Published: Jan. 3, 2017, 8:08 a.m.
Duration: 53 minutes 46 seconds

Listed in: Technology

Lecture 2: Divide & Conquer: Convex Hull, Median Finding

Published: Jan. 3, 2017, 8:07 a.m.
Duration: 1 hour 20 minutes 34 seconds

Listed in: Technology

Lecture 1: Course Overview, Interval Scheduling

Published: Jan. 3, 2017, 8:06 a.m.
Duration: 1 hour 23 minutes 34 seconds

Listed in: Technology

Co-Teaching the Course

Published: Jan. 3, 2017, 8:05 a.m.
Duration: 2 minutes 18 seconds

Listed in: Technology

Engaging Students

Published: Jan. 3, 2017, 8:04 a.m.
Duration: 54 seconds

Listed in: Technology

On the Challenge of Assessing Students' Abiliites to Apply Algorithms in New and Creative Ways

Published: Jan. 3, 2017, 8:03 a.m.
Duration: 2 minutes 37 seconds

Listed in: Technology

On Teaching Complex Content

Published: Jan. 3, 2017, 8:02 a.m.
Duration: 3 minutes 43 seconds

Listed in: Technology

Meet the Educator

Published: Jan. 3, 2017, 8:01 a.m.
Duration: 3 minutes 10 seconds

Listed in: Technology