Erik Demaine
About
Erik Demaine is an Esther and Harold E. Edgerton Professor and Associate Professor in the department of electrical engineering and computer science, and a member of the Theory of Computation group in
Read lessUploaded videos
01:23:48
Lecture 10: Red-black Trees, Rotations, Insertions, Deletions
2009-02-10
·
152700 Views
01:10:28
Lecture 2: Asymptotic Notation, Recurrences, Substitution, Master Method
2009-02-10
·
126991 Views
01:17:13
Lecture 18: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Cons...
2009-02-10
·
105483 Views
01:24:33
Lecture 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Se...
2009-02-10
·
64754 Views
01:08:32
Lecture 3: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication
2009-02-10
·
54399 Views
01:25:31
Lecture 12: Skip Lists
2009-02-10
·
47125 Views
01:16:46
Lecture 5: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort
2009-02-10
·
40195 Views
01:14:55
Lecture 19: Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication,...
2009-02-10
·
33760 Views
01:21:21
Lecture 9: Relation of BSTs to Quicksort, Analysis of Random BST
2009-02-10
·
22764 Views
01:25:20
Lecture 25: Advanced Topics (cont.), Discussion of Follow-on Classes
2009-02-10
·
10749 Views
01:24:46
Lecture 24: Advanced Topics (cont.)
2009-02-10
·
10440 Views