| S# |
Lecture |
Course |
Institute |
Instructor |
Discipline |
| 26 |
24. Cache-Oblivious Algorithms: Searching & (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
|
| 27 |
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
|
| 28 |
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
|
| 29 |
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
|
| 30 |
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
|
| 31 |
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
|
| 32 |
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
|
| 33 |
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
|
| 34 |
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
|
| 35 |
R10. Distributed 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
|
| 36 |
R11. Cryptography: More Primitives (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
|
| 37 |
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
|
| 38 |
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
|
| 39 |
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
|
| 40 |
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
|
| 41 |
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
|
| 42 |
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
|
| 43 |
R9. Approximation Algorithms: Traveling Salesman Problem (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
|
