Introduction to Algorithms (2005) - Audio

Introduction to Algorithms (2005) - Audio

Follow Introduction to Algorithms (2005) - Audio
Share on
Copy link to clipboard

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;…

Prof. Erik Demaine Prof. Charles Leiserson


    • May 10, 2007 LATEST EPISODE
    • infrequent NEW EPISODES
    • 1h 18m AVG DURATION
    • 23 EPISODES


    Search for episodes from Introduction to Algorithms (2005) - Audio with a specific topic:

    Latest episodes from Introduction to Algorithms (2005) - Audio

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

    Play Episode Listen Later May 10, 2007 86:01


    Lecture 24: Advanced Topics (cont.)

    Play Episode Listen Later May 10, 2007 85:26


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

    Play Episode Listen Later May 10, 2007 85:14


    Lecture 23: Advanced Topics (cont.)

    Play Episode Listen Later May 10, 2007 77:24


    Lecture 22: Advanced Topics

    Play Episode Listen Later May 10, 2007 75:43


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

    Play Episode Listen Later May 10, 2007 75:36


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

    Play Episode Listen Later May 10, 2007 77:54


    Lecture 16: Greedy Algorithms, Minimum Spanning Trees

    Play Episode Listen Later May 10, 2007 84:46


    Lecture 15: Dynamic Programming, Longest Common Subsequence

    Play Episode Listen Later May 10, 2007 71:37


    Lecture 14: Competitive Analysis: Self-organizing Lists

    Play Episode Listen Later May 10, 2007 75:05


    Lecture 13: Amortized Algorithms, Table Doubling, Potential Method

    Play Episode Listen Later May 10, 2007 79:44


    Lecture 12: Skip lists

    Play Episode Listen Later May 10, 2007 86:11


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

    Play Episode Listen Later May 10, 2007 84:25


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

    Play Episode Listen Later May 10, 2007 84:31


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

    Play Episode Listen Later May 10, 2007 82:01


    Lecture 07: Hashing, Hash Functions

    Play Episode Listen Later May 10, 2007 78:44


    Lecture 08: Universal Hashing, Perfect Hashing

    Play Episode Listen Later May 10, 2007 72:41


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

    Play Episode Listen Later May 10, 2007 77:27


    Lecture 06: Order Statistics, Median

    Play Episode Listen Later May 10, 2007 69:25


    Lecture 04: Quicksort, Randomized Algorithms

    Play Episode Listen Later May 10, 2007 81:12


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

    Play Episode Listen Later May 10, 2007 69:08


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

    Play Episode Listen Later May 10, 2007 81:14


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

    Play Episode Listen Later May 10, 2007 71:07


    Claim Introduction to Algorithms (2005) - Audio

    In order to claim this podcast we'll send an email to with a verification link. Simply click the link and you will be able to edit tags, request a refresh, and other features to take control of your podcast page!

    Claim Cancel