| S# |
Lecture |
Course |
Institute |
Instructor |
Discipline |
| 1826 |
14. Depth-First Search (DFS), Topological Sort (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1827 |
R10. Quiz 1 Review (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1828 |
15. Single-Source Shortest Paths Problem (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1829 |
R11. Principles of Algorithm Design (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1830 |
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1831 |
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1832 |
R12. Karatsuba Multiplication, Newton's Method (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1833 |
R13. Breadth-First Search (BFS) (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1834 |
18. Speeding up Dijkstra (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1835 |
R14. Depth-First Search (DFS) (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1836 |
19. Dynamic Programming I: Fibonacci, Shortest Paths (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1837 |
2. Models of Computation, Document Distance (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1838 |
R15. Shortest Paths (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1839 |
20. Dynamic Programming II: Text Justification, Blackjack (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1840 |
R16. Rubik's Cube, StarCraft Zero (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1841 |
21. DP III: Parenthesization, Edit Distance, Knapsack (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1842 |
R18. Quiz 2 Review (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1843 |
R19. Dynamic Programming: Crazy Eights, Shortest Path (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1844 |
22. DP IV: Guitar Fingering, Tetris, Super Mario Bros. (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1845 |
R2. Python Cost Model, Document Distance (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1846 |
23. Computational Complexity (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1847 |
R20. Dynamic Programming: Blackjack (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1848 |
24. Topics in Algorithms Research (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
| 1849 |
R21. Dynamic Programming: Knapsack Problem (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Victor Costan
|
Applied Sciences
|
| 1850 |
3. Insertion Sort, Merge Sort (M-I-T)
|
Introduction to Algorithms, Fall 2011 (M-I-T)
|
MIT
|
Srini Devadas
|
Applied Sciences
|
