MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005

MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005

23 Videos · Sep 7, 2005

About

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.

This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5503 (Analysis and Design of Algorithms).

Course Homepage 6.046J / 18.410J Introduction to Algorithms (SMA 5503) Fall 2005

Course features at MIT OpenCourseWare page: *Syllabus *Calendar *Readings *Assignments *Exams *Download Course Materials

Complete MIT OCW video collection at MIT OpenCourseWare - VideoLectures.NET

Videos

video-img
01:08:32

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

Erik Demaine

Feb 10, 2009

 · 

54428 views

video-img
01:17:35

Lecture 7: Hashing, Hash Functions

Charles E. Leiserson

Feb 10, 2009

 · 

43209 views

video-img
01:19:46

Lecture 8: Universal Hashing, Perfect Hashing

Charles E. Leiserson

Feb 10, 2009

 · 

39325 views

video-img
01:20:30

Lecture 4: Quicksort, Randomized Algorithms

Charles E. Leiserson

Feb 10, 2009

 · 

62807 views

video-img
01:10:56

Lecture 15: Dynamic Programming, Longest Common Subsequence

Charles E. Leiserson

Feb 10, 2009

 · 

80720 views

video-img
01:10:28

Lecture 2: Asymptotic Notation, Recurrences, Substitution, Master Method

Erik Demaine

Feb 10, 2009

 · 

127148 views

video-img
01:19:05

Lecture 13: Amortized Algorithms, Table Doubling, Potential Method

Charles E. Leiserson

Feb 10, 2009

 · 

39898 views

video-img
01:15:07

Lecture 22: Advanced Topics

Charles E. Leiserson

Feb 10, 2009

 · 

18168 views

video-img
01:20:32

Lecture 1: Administrivia, Introduction, Analysis of Algorithms, Insertion Sort, ...

Charles E. Leiserson

Feb 10, 2009

 · 

133493 views

video-img
01:21:21

Lecture 9: Relation of BSTs to Quicksort, Analysis of Random BST

Erik Demaine

Feb 10, 2009

 · 

22775 views

video-img
01:24:46

Lecture 24: Advanced Topics (cont.)

Erik Demaine

Feb 10, 2009

 · 

10446 views

video-img
01:23:44

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

Charles E. Leiserson

Feb 10, 2009

 · 

31329 views

video-img
01:14:55

Lecture 19: Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication,...

Erik Demaine

Feb 10, 2009

 · 

33784 views

video-img
01:17:03

Lecture 23: Advanced Topics (cont.)

Charles E. Leiserson

Feb 10, 2009

 · 

10727 views

video-img
01:23:48

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

Erik Demaine

Feb 10, 2009

 · 

152781 views

video-img
01:25:31

Lecture 12: Skip Lists

Erik Demaine

Feb 10, 2009

 · 

47261 views

video-img
01:24:06

Lecture 16: Greedy Algorithms, Minimum Spanning Trees

Charles E. Leiserson

Feb 10, 2009

 · 

57683 views

video-img
01:16:46

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

Erik Demaine

Feb 10, 2009

 · 

40211 views

video-img
01:24:33

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

Erik Demaine

Feb 10, 2009

 · 

64819 views

video-img
01:08:48

Lecture 6: Order Statistics, Median

Charles E. Leiserson

Feb 10, 2009

 · 

31738 views

video-img
01:17:13

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

Erik Demaine

Feb 10, 2009

 · 

105511 views

video-img
01:14:27

Lecture 14: Competitive Analysis: Self-organizing

Charles E. Leiserson

Feb 10, 2009

 · 

13703 views

video-img
01:25:20

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

Erik Demaine

Feb 10, 2009

 · 

10759 views