File List
-
1 - 1 - Application- Internet Routing (11 min).mp4 13.85 MB
1 - 2 - Application- Sequence Alignment (9 min).mp4 11.1 MB
10 - 1 - Introduction- Weighted Independent Sets in Path Graphs (8 min).mp4 11.26 MB
10 - 2 - WIS in Path Graphs- Optimal Substructure (9 min).mp4 13.52 MB
10 - 3 - WIS in Path Graphs- A Linear-Time Algorithm (10 min).mp4 14.54 MB
10 - 4 - WIS in Path Graphs- A Reconstruction Algorithm (7 min).mp4 9.62 MB
10 - 5 - Principles of Dynamic Programming (8 min).mp4 12.27 MB
11 - 1 - The Knapsack Problem (10 min).mp4 14.08 MB
11 - 2 - A Dynamic Programming Algorithm (10 min).mp4 13.61 MB
11 - 3 - Example [Review - Optional] (14 min).mp4 24.21 MB
12 - 1 - Optimal Substructure (14 min).mp4 19.54 MB
12 - 2 - A Dynamic Programming Algorithm (12 min).mp4 16.71 MB
13 - 1 - Problem Definition (12 min).mp4 17.19 MB
13 - 2 - Optimal Substructure (9 min).mp4 13.94 MB
13 - 3 - Proof of Optimal Substructure (7 min) (1).mp4 9.86 MB
13 - 3 - Proof of Optimal Substructure (7 min).mp4 9.86 MB
13 - 4 - A Dynamic Programming Algorithm I (10 min) (1).mp4 14.05 MB
13 - 4 - A Dynamic Programming Algorithm I (10 min).mp4 14.05 MB
13 - 5 - A Dynamic Programming Algorithm II (9 min) (1).mp4 11.94 MB
13 - 5 - A Dynamic Programming Algorithm II (9 min).mp4 11.94 MB
14 - 1 - Single-Source Shortest Paths, Revisted (11 min) (1).mp4 15.15 MB
14 - 1 - Single-Source Shortest Paths, Revisted (11 min).mp4 15.15 MB
14 - 2 - Optimal Substructure (11 min) (1).mp4 15.27 MB
14 - 2 - Optimal Substructure (11 min).mp4 15.27 MB
14 - 3 - The Basic Algorithm I (9 min) (1).mp4 12.11 MB
14 - 3 - The Basic Algorithm I (9 min).mp4 12.11 MB
14 - 4 - The Basic Algorithm II (11 min) (1).mp4 13.61 MB
14 - 4 - The Basic Algorithm II (11 min).mp4 13.61 MB
14 - 5 - Detecting Negative Cycles (9 min) (1).mp4 12.78 MB
14 - 5 - Detecting Negative Cycles (9 min).mp4 12.78 MB
14 - 6 - A Space Optimization (12 min) (1).mp4 18.34 MB
14 - 6 - A Space Optimization (12 min).mp4 18.34 MB
14 - 7 - Internet Routing I [Optional] (11 min) (1).mp4 16.72 MB
14 - 7 - Internet Routing I [Optional] (11 min).mp4 16.72 MB
14 - 8 - Internet Routing II [Optional] (7 min) (1).mp4 10.68 MB
14 - 8 - Internet Routing II [Optional] (7 min).mp4 10.68 MB
15 - 1 - Problem Definition (7 min) (1).mp4 9.48 MB
15 - 1 - Problem Definition (7 min) (2).mp4 9.48 MB
15 - 1 - Problem Definition (7 min).mp4 9.48 MB
15 - 2 - Optimal Substructure (12 min) (1).mp4 16.53 MB
15 - 2 - Optimal Substructure (12 min).mp4 16.53 MB
15 - 3 - The Floyd-Warshall Algorithm (13 min).mp4 18.89 MB
15 - 4 - A Reweighting Technique (14 min).mp4 19.62 MB
15 - 5 - Johnson-'s Algorithm I (11 min).mp4 15.49 MB
15 - 6 - Johnson-'s Algorithm II (11 min).mp4 16.86 MB
16 - 1 - Polynomial-Time Solvable Problems (14 min).mp4 20.49 MB
16 - 2 - Reductions and Completeness (14 min).mp4 19.86 MB
16 - 3 - Definition and Interpretation of NP-Completeness I (11 min).mp4 16.35 MB
16 - 4 - Definition and Interpretation of NP-Completeness II (8 min).mp4 12.18 MB
16 - 5 - The P vs. NP Question (9 min).mp4 14.28 MB
16 - 6 - Algorithmic Approaches to NP-Complete Problems (13 min).mp4 19.86 MB
17 - 1 - The Vertex Cover Problem (9 min).mp4 12.75 MB
17 - 2 - Smarter Search for Vertex Cover I (10 min).mp4 14.14 MB
17 - 3 - Smarter Search for Vertex Cover II (8 min).mp4 10.37 MB
17 - 4 - The Traveling Salesman Problem (15 min).mp4 21 MB
17 - 5 - A Dynamic Programming Algorithm for TSP (12 min).mp4 17.45 MB
18 - 1 - A Greedy Knapsack Heuristic (14 min).mp4 18.74 MB
18 - 2 - Analysis of a Greedy Knapsack Heuristic I (7 min).mp4 8.93 MB
18 - 3 - Analysis of a Greedy Knapsack Heuristic II (10 min).mp4 12.4 MB
18 - 4 - A Dynamic Programming Heuristic for Knapsack (12 min).mp4 15.41 MB
18 - 5 - Knapsack via Dynamic Programming, Revisited (10 min).mp4.crdownload 3.16 MB
18 - 6 - Ananysis of Dynamic Programming Heuristic (15 min).mp4 18.7 MB
19 - 1 - The Maximum Cut Problem I (9 min).mp4 12.41 MB
19 - 2 - The Maximum Cut Problem II (9 min).mp4 12.84 MB
19 - 3 - Principles of Local Search I (9 min).mp4 12.22 MB
19 - 4 - Principles of Local Search II (10 min).mp4 14.49 MB
19 - 5 - The 2-SAT Problem (15 min).mp4 19.64 MB
19 - 6 - Random Walks on a Line (16 min).mp4 21.33 MB
19 - 7 - Analysis of Papadimitriou-'s Algorithm (15 min).mp4 21.62 MB
2 - 1 - About the Course [Part I Review - Optional] (17 min).mp4 18.33 MB
2 - 2 - Why Study Algorithms- [Part I Review - Optional] (19 min).mp4 20.25 MB
2 - 3 - Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).mp4 18.86 MB
2 - 4 - Big-Oh Notation [Part I Review - Optional] (4 min).mp4 4.36 MB
2 - 5 - Graph Representations [Part I Review - Optional] (14 min).mp4 14.48 MB
2 - 6 - Graph Search - Overview [Part I Review - Optional] (23 min).mp4 24.36 MB
2 - 7 - Dijkstra-'s Shortest-Path Algorithm [Part I Review - Optional] (21 min).mp4 21.92 MB
2 - 8 - Data Structures- Overview [Part I Review - Optional] (5 min).mp4 4.89 MB
2 - 9 - Heaps- Operations and Applications [Part I Review - Optional] (18 min).mp4 19.49 MB
20 - 1 - Stable Matching [Optional] (15 min).mp4 22.55 MB
20 - 2 - Matchings, Flows, and Braess-'s Paradox [Optional] (14 min).mp4 20.96 MB
20 - 3 - Linear Programming and Beyond [Optional] (11 min).mp4 16.84 MB
20 - 4 - Epilogue (1 min).mp4 1.79 MB
3 - 1 - Introduction to Greedy Algorithms (13 min).mp4 18.04 MB
3 - 2 - Application- Optimal Caching (11 min).mp4 14.97 MB
4 - 1 - Problem Definition (6 min).mp4 7.79 MB
4 - 2 - A Greedy Algorithm (13 min).mp4 17.16 MB
4 - 3 - Correctness Proof - Part I (7 min).mp4 9.22 MB
4 - 4 - Correctness Proof - Part II (5 min).mp4 6.22 MB
4 - 5 - Handling Ties [Advanced - Optional] (7 min).mp4 9.65 MB
5 - 1 - MST Problem Definition (11 min).mp4 15 MB
5 - 2 - Prim-'s MST Algorithm (8 min).mp4 9.99 MB
5 - 3 - Correctness Proof I (16 min).mp4 19.02 MB
5 - 4 - Correctness Proof II (8 min).mp4 10.14 MB
5 - 5 - Proof of Cut Property [Advanced - Optional] (12 min).mp4 60.81 KB
5 - 6 - Fast Implementation I (15 min).mp4 19.66 MB
5 - 7 - Fast Implementation II (10 min).mp4 13.17 MB
6 - 1 - Kruskal-'s MST Algorithm (8 min).mp4 11.02 MB
6 - 2 - Correctness of Kruskal-'s Algorithm (9 min).mp4 12.3 MB
6 - 3 - Implementing Kruskal-'s Algorithm via Union-Find I (9 min).mp4 12.9 MB
6 - 4 - Implementing Kruskal-'s Algorithm via Union-Find II (14 min).mp4 18.88 MB
6 - 5 - MSTs- State-of-the-Art and Open Questions [Advanced - Optional] (9 min).mp4 14.23 MB
7 - 1 - Application to Clustering (12 min).mp4 15.13 MB
7 - 2 - Correctness of Clustering Algorithm (10 min).mp4 11.93 MB
8 - 1 - Lazy Unions [Advanced - Optional] (10 min).mp4 15.24 MB
8 - 2 - Union-by-Rank [Advanced - Optional] (12 min).mp4 18.19 MB
8 - 3 - Analysis of Union-by-Rank [Advanced - Optional] (15 min).mp4 22.29 MB
8 - 4 - Path Compression [Advanced - Optional] (15 min).mp4 21.51 MB
8 - 5 - Path Compression- The Hopcroft-Ullman Analysis I [Advanced - Optional] (9 min).mp4 13.66 MB
8 - 6 - Path Compression- The Hopcroft-Ullman Analysis II [Advanced - Optional] (12 min).mp4 17.17 MB
8 - 7 - The Ackermann Function [Advanced - Optional] (17 min).mp4 22.64 MB
8 - 8 - Path Compression- Tarjan-'s Analysis I [Advanced - Optional] (14 min).mp4 20.78 MB
8 - 9 - Path Compression- Tarjan-'s Analysis II [Advanced - Optional] (14 min).mp4 19.09 MB
9 - 1 - Introduction and Motivation (9 min).mp4 11.89 MB
9 - 2 - Problem Definition (10 min).mp4 15.35 MB
9 - 3 - A Greedy Algorithm (17 min).mp4 24.7 MB
9 - 4 - A More Complex Example (4 min).mp4 5.51 MB
9 - 5 - Correctness Proof I (10 min).mp4 13.3 MB
9 - 6 - Correctness Proof II (13 min).mp4 16.75 MB
Download Info
-
Tips
“Algo2-Stanford” Its related downloads are collected from the DHT sharing network, the site will be 24 hours of real-time updates, to ensure that you get the latest resources.This site is not responsible for the authenticity of the resources, please pay attention to screening.If found bad resources, please send a report below the right, we will be the first time shielding.
-
DMCA Notice and Takedown Procedure
If this resource infringes your copyright, please email([email protected]) us or leave your message here ! we will block the download link as soon as possiable.