SEARCH COURSES

Design and Analysis of Algorithms (M-I-T)

(34 Lectures Available)


S# Lecture Course Institute Instructor Discipline
1 1. Course Overview, Interval Scheduling (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
2 2. Divide & Conquer: Convex Hull, Median Finding (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
3 R1. Matrix Multiplication and the Master Theorem (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
4 3. Divide & Conquer: FFT (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
5 R2. 2-3 Trees and B-Trees (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
6 4. Divide & Conquer: van Emde Boas Trees (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
7 5. Amortization: Amortized Analysis (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
8 6. Randomization: Matrix Multiply, Quicksort (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
9 R4. Randomized Select and Randomized Quicksort (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
10 7. Randomization: Skip Lists (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
11 8. Randomization: Universal & Perfect Hashing (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
12 R5. Dynamic Programming (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
13 9. Augmentation: Range Trees (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
14 10. Dynamic Programming: Advanced DP (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
15 11. Dynamic Programming: All-Pairs Shortest Paths (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
16 12. Greedy Algorithms: Minimum Spanning Tree (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
17 R6. Greedy Algorithms (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
18 13. Incremental Improvement: Max Flow, Min Cut (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
19 14. Incremental Improvement: Matching (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
20 R7. Network Flow and Matching (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
21 15. Linear Programming: LP, reductions, Simplex (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
22 16. Complexity: P, NP, NP-completeness, Reductions (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
23 R8. NP-Complete Problems (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
24 17. Complexity: Approximation Algorithms (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences
25 18. Complexity: Fixed-Parameter Algorithms (M-I-T) Design and Analysis of Algorithms (M-I-T) MIT Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch Applied Sciences

of 2 34 Lectures Available.