| S# |
Lecture |
Course |
Institute |
Instructor |
Discipline |
| 1626 |
21. Cryptography: Hash Functions (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
|
| 1627 |
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
|
| 1628 |
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
|
| 1629 |
22. Cryptography: Encryption (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
|
| 1630 |
23. Cache-Oblivious Algorithms: Medians & Matrices (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
|
| 1631 |
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
|
| 1632 |
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
|
| 1633 |
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
|
| 1634 |
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
|
| 1635 |
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
|
| 1636 |
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
|
| 1637 |
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
|
| 1638 |
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
|
| 1639 |
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
|
| 1640 |
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
|
| 1641 |
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
|
| 1642 |
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
|
| 1643 |
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
|
| 1644 |
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
|
| 1645 |
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
|
| 1646 |
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
|
| 1647 |
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
|
| 1648 |
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
|
| 1649 |
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
|
| 1650 |
Back-propagation through time – backwards pass (M-I-T)
|
Introduction to Machine Learning (Fall 2020) (M-I-T)
|
MIT
|
Prof. Leslie Kaelbling
|
Applied Sciences
|
