Introduction to Algorithms (2005) - Audio

Introduction to Algorithms (2005) - Audio

23 episodes

This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.

Podcasts

Lecture 25: Advanced Topics (cont.)/Discussion of Follow-on Classes

Published: May 10, 2007, 2:51 p.m.
Duration: 1 hour 26 minutes 1 second

Listed in: Technology

Lecture 24: Advanced Topics (cont.)

Published: May 10, 2007, 2:51 p.m.
Duration: 1 hour 25 minutes 26 seconds

Listed in: Technology

Lecture 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search

Published: May 10, 2007, 2:48 p.m.
Duration: 1 hour 25 minutes 14 seconds

Listed in: Technology

Lecture 23: Advanced Topics (cont.)

Published: May 10, 2007, 2:44 p.m.
Duration: 1 hour 17 minutes 24 seconds

Listed in: Technology

Lecture 22: Advanced Topics

Published: May 10, 2007, 2:43 p.m.
Duration: 1 hour 15 minutes 43 seconds

Listed in: Technology

Lecture 19: Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson

Published: May 10, 2007, 2:42 p.m.
Duration: 1 hour 15 minutes 36 seconds

Listed in: Technology

Lecture 18: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints

Published: May 10, 2007, 2:41 p.m.
Duration: 1 hour 17 minutes 54 seconds

Listed in: Technology

Lecture 16: Greedy Algorithms, Minimum Spanning Trees

Published: May 10, 2007, 2:33 p.m.
Duration: 1 hour 24 minutes 46 seconds

Listed in: Technology

Lecture 15: Dynamic Programming, Longest Common Subsequence

Published: May 10, 2007, 2:33 p.m.
Duration: 1 hour 11 minutes 37 seconds

Listed in: Technology

Lecture 14: Competitive Analysis: Self-organizing Lists

Published: May 10, 2007, 2:32 p.m.
Duration: 1 hour 15 minutes 5 seconds

Listed in: Technology

Lecture 13: Amortized Algorithms, Table Doubling, Potential Method

Published: May 10, 2007, 2:32 p.m.
Duration: 1 hour 19 minutes 44 seconds

Listed in: Technology

Lecture 12: Skip lists

Published: May 10, 2007, 2:31 p.m.
Duration: 1 hour 26 minutes 11 seconds

Listed in: Technology

Lecture 11: Augmenting Data Structures, Dynamic Order Statistics, Interval Trees

Published: May 10, 2007, 2:31 p.m.
Duration: 1 hour 24 minutes 25 seconds

Listed in: Technology

Lecture 10: Red-black Trees, Rotations, Insertions, Deletions

Published: May 10, 2007, 2:29 p.m.
Duration: 1 hour 24 minutes 31 seconds

Listed in: Technology

Lecture 09: Relation of BSTs to Quicksort/Analysis of Random BST

Published: May 10, 2007, 2:29 p.m.
Duration: 1 hour 22 minutes 1 second

Listed in: Technology

Lecture 07: Hashing, Hash Functions

Published: May 10, 2007, 2:28 p.m.
Duration: 1 hour 18 minutes 44 seconds

Listed in: Technology

Lecture 08: Universal Hashing, Perfect Hashing

Published: May 10, 2007, 2:28 p.m.
Duration: 1 hour 12 minutes 41 seconds

Listed in: Technology

Lecture 05: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort

Published: May 10, 2007, 2:27 p.m.
Duration: 1 hour 17 minutes 27 seconds

Listed in: Technology

Lecture 06: Order Statistics, Median

Published: May 10, 2007, 2:27 p.m.
Duration: 1 hour 9 minutes 25 seconds

Listed in: Technology

Lecture 04: Quicksort, Randomized Algorithms

Published: May 10, 2007, 2:24 p.m.
Duration: 1 hour 21 minutes 12 seconds

Listed in: Technology

Lecture 03: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication

Published: May 10, 2007, 2:24 p.m.
Duration: 1 hour 9 minutes 8 seconds

Listed in: Technology

Lecture 01: Administrivia/Introduction/Analysis of Algorithms, Insertion Sort, Mergesort

Published: May 10, 2007, 2:23 p.m.
Duration: 1 hour 21 minutes 14 seconds

Listed in: Technology

Lecture 02: Asymptotic Notation/Recurrences/Substitution, Master Method

Published: May 10, 2007, 2:23 p.m.
Duration: 1 hour 11 minutes 7 seconds

Listed in: Technology