Introduction to Algorithms (2005)

Introduction to Algorithms (2005)

Follow Introduction to Algorithms (2005)

Share on

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

Aug 5, 2016 LATEST EPISODE
infrequent NEW EPISODES
1h 18m AVG DURATION
23 EPISODES

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

Latest episodes from Introduction to Algorithms (2005)

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

Play Episode Listen Later Aug 5, 2016 80:37

sort algorithms lecture insertion

Lecture 06: Order Statistics, Median

Play Episode Listen Later Jul 9, 2015 68:51

statistics lecture median

Lecture 13: Amortized Algorithms, Table Doubling, Potential Method

Play Episode Listen Later Jul 9, 2015 79:08

table method algorithms lecture doubling

Lecture 04: Quicksort, Randomized Algorithms

Play Episode Listen Later Jul 9, 2015 80:35

algorithms lecture randomized

Lecture 12: Skip Lists

Play Episode Listen Later Jul 9, 2015 85:34

skip lists lecture

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

Play Episode Listen Later Jul 9, 2015 83:53

trees lecture rotations red black deletions

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

Play Episode Listen Later Jul 9, 2015 81:24

lecture relation

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

Play Episode Listen Later Jul 9, 2015 76:52

lower counting lecture sorting bounds radix linear time

Lecture 24: Advanced Topics (cont

Play Episode Listen Later Jul 9, 2015 84:49

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

Play Episode Listen Later Jul 9, 2015 77:19

programming lecture paths linear constraints shortest bellman

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

Play Episode Listen Later Jul 9, 2015 83:47

trees statistics dynamic lecture interval augmenting data structures

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

Play Episode Listen Later Jul 9, 2015 68:36

lecture multiplication fibonacci divide and conquer strassen polynomials

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

Play Episode Listen Later Jul 9, 2015 75:01

matrix floyd lecture paths multiplication pairs shortest

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

Play Episode Listen Later Jul 9, 2015 70:34

master method lecture substitution notation asymptotic recurrences

Lecture 16: Greedy Algorithms, Minimum Spanning Trees

Play Episode Listen Later Jul 9, 2015 84:09

trees algorithms lecture minimum greedy spanning

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

Play Episode Listen Later Jul 9, 2015 85:23

classes lecture cont

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

Play Episode Listen Later Jul 9, 2015 84:36

search algorithms lecture paths properties shortest breadth

Lecture 22: Advanced Topics

Play Episode Listen Later Jul 9, 2015 75:10

Lecture 15: Dynamic Programming, Longest Common Subsequence

Play Episode Listen Later Jul 9, 2015 71:03

lecture longest dynamic programming

Lecture 08: Universal Hashing, Perfect Hashing

Play Episode Listen Later Jul 9, 2015 79:48

universal lecture hashing

Lecture 07: Hashing, Hash Functions

Play Episode Listen Later Jul 9, 2015 77:42

lecture functions hashing

Lecture 23: Advanced Topics (cont.)

Play Episode Listen Later Jul 9, 2015 76:50

Lecture 14: Competitive Analysis: Self-organizing Lists

Play Episode Listen Later Jul 9, 2015 74:29

lists lecture competitive analysis self organizing

Claim Introduction to Algorithms (2005)

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!