|
Обратите внимание, что наш сайт не размещает какие-либо файлы из списка. Вы не можете скачать
эти файлы или скачать torrent-файл.
|
| 10 - 1 - Introduction - Weighted Independent Sets in Path Graphs (8 min) [65fbd448] .mp4 |
11.26Мб |
| 10 - 1 - The Knapsack Problem (10 min).srt |
14.41Кб |
| 10 - 2 - A Dynamic Programming Algorithm (10 min).srt |
14.83Кб |
| 10 - 2 - WIS in Path Graphs - Optimal Substructure (9 min) [589175a6] .mp4 |
13.52Мб |
| 10 - 3 - WIS in Path Graphs - A Linear-Time Algorithm (10 min) [0148f8b6] .mp4 |
14.54Мб |
| 10 - 4 - WIS in Path Graphs - A Reconstruction Algorithm (7 min) [b977a9ca] .mp4 |
9.62Мб |
| 10 - 5 - Principles of Dynamic Programming (8 min) [7ac867a4] .mp4 |
12.27Мб |
| 11 - 1 - Application to Clustering (12 min).srt |
18.50Кб |
| 11 - 1 - The Knapsack Problem (9 min) [319dc01b] .mp4 |
14.08Мб |
| 11 - 2 - A Dynamic Programming Algorithm (9 min) [55792123] .mp4 |
13.61Мб |
| 11 - 2 - Correctness of Clustering Algorithm (10 min).srt |
16.36Кб |
| 1 - 1 - Application Internet Routing (11 min).srt |
17.78Кб |
| 1 - 1 - Application Internet Routing (11 min) [6cb92f13] .mp4 |
13.85Мб |
| 12 - 1 - Optimal Substructure (14 min).srt |
21.10Кб |
| 12 - 1 - Optimal Substructure (14 min) [207bb803] .mp4 |
19.54Мб |
| 12 - 2 - A Dynamic Programming Algorithm (12 min).srt |
19.11Кб |
| 12 - 2 - A Dynamic Programming Algorithm (12 min) [835dbf7e] .mp4 |
16.71Мб |
| 1 - 2 - Application Sequence Alignment (9 min).srt |
13.35Кб |
| 1 - 2 - Application Sequence Alignment (9 min) [722963dd] .mp4 |
11.10Мб |
| 13 - 1 - Problem Definition (12 min).srt |
20.18Кб |
| 13 - 1 - Problem Definition (12 min) [ccba5e58] .mp4 |
17.19Мб |
| 13 - 2 - Optimal Substructure (9 min).srt |
15.57Кб |
| 13 - 2 - Optimal Substructure (9 min) [239442ab] .mp4 |
13.94Мб |
| 13 - 3 - Proof of Optimal Substructure (7 min).srt |
9.71Кб |
| 13 - 3 - Proof of Optimal Substructure (7 min) [7eadf7bc] .mp4 |
9.86Мб |
| 13 - 4 - A Dynamic Programming Algorithm I (10 min).srt |
16.26Кб |
| 13 - 4 - A Dynamic Programming Algorithm I (10 min) [d8ef4cfe] .mp4 |
14.05Мб |
| 13 - 5 - A Dynamic Programming Algorithm II (9 min).srt |
15.42Кб |
| 13 - 5 - A Dynamic Programming Algorithm II (9 min) [8726ac90] .mp4 |
11.94Мб |
| 14 - 1 - Single-Source Shortest Paths, Revisted (11 min) [271afebc] .mp4 |
15.15Мб |
| 14 - 1 - Single-Source Shortest Paths Revisted (11 min).srt |
17.50Кб |
| 14 - 2 - Optimal Substructure (11 min).srt |
16.47Кб |
| 14 - 2 - Optimal Substructure (11 min) [2b8608e6] .mp4 |
15.27Мб |
| 14 - 3 - The Basic Algorithm I (9 min).srt |
12.52Кб |
| 14 - 3 - The Basic Algorithm I (9 min) [2b42b24d] .mp4 |
12.11Мб |
| 14 - 4 - The Basic Algorithm II (11 min).srt |
16.05Кб |
| 14 - 4 - The Basic Algorithm II (11 min) [67091f5b] .mp4 |
13.61Мб |
| 14 - 5 - Detecting Negative Cycles (9 min).srt |
14.35Кб |
| 14 - 5 - Detecting Negative Cycles (9 min) [15b99fd4] .mp4 |
12.78Мб |
| 14 - 6 - A Space Optimization (12 min).srt |
18.61Кб |
| 14 - 6 - A Space Optimization (12 min) [11984b71] .mp4 |
18.34Мб |
| 14 - 7 - Internet Routing I (11 min) [2b9cdca2] .mp4 |
16.72Мб |
| 14 - 7 - Internet Routing I [Optional] (11 min).srt |
18.93Кб |
| 14 - 8 - Internet Routing II (7 min) [01894cec] .mp4 |
10.68Мб |
| 14 - 8 - Internet Routing II [Optional] (7 min).srt |
11.08Кб |
| 15 - 1 - Problem Definition (7 min).srt |
11.12Кб |
| 15 - 1 - Problem Definition (7 min) [2956c05c] .mp4 |
9.48Мб |
| 15 - 2 - Optimal Substructure (12 min).srt |
19.76Кб |
| 15 - 2 - Optimal Substructure (12 min) [0fd68539] .mp4 |
16.53Мб |
| 15 - 3 - The Floyd-Warshall Algorithm (13 min).srt |
21.63Кб |
| 15 - 3 - The Floyd-Warshall Algorithm (13 min) [ee779bb2] .mp4 |
18.89Мб |
| 15 - 4 - A Reweighting Technique (14 min).srt |
20.57Кб |
| 15 - 4 - A Reweighting Technique (14 min) [17e57ff9] .mp4 |
19.62Мб |
| 15 - 5 - Johnson's Algorithm I (11 min) [4a33d6c3] .mp4 |
15.49Мб |
| 15 - 5 - Johnsons Algorithm I (11 min).srt |
15.67Кб |
| 15 - 6 - Johnson's Algorithm II (11 min) [0388fabb] .mp4 |
16.86Мб |
| 15 - 6 - Johnsons Algorithm II (11 min).srt |
16.87Кб |
| 16 - 1 - Polynomial-Time Solvable Problems (14 min).srt |
21.39Кб |
| 16 - 1 - Polynomial-Time Solvable Problems (14 min) [77e7a40c] .mp4 |
20.49Мб |
| 16 - 2 - Reductions and Completeness (14 min).srt |
19.92Кб |
| 16 - 2 - Reductions and Completeness (14 min) [ae15d261] .mp4 |
19.86Мб |
| 16 - 3 - Definition and Interpretation of NP-Completeness I (11 min).srt |
15.75Кб |
| 16 - 3 - Definition and Interpretation of NP-Completeness I (11 min) [6e11daca] .mp4 |
16.35Мб |
| 16 - 4 - Definition and Interpretation of NP-Completeness II (8 min).srt |
11.65Кб |
| 16 - 4 - Definition and Interpretation of NP-Completeness II (8 min) [c332ad52] .mp4 |
12.18Мб |
| 16 - 5 - The P vs. NP Question (9 min).srt |
13.21Кб |
| 16 - 5 - The P vs. NP Question (9 min) [18428f98] .mp4 |
14.28Мб |
| 16 - 6 - Algorithmic Approaches to NP-Complete Problems (13 min).srt |
20.39Кб |
| 16 - 6 - Algorithmic Approaches to NP-Complete Problems (13 min) [f35b5954] .mp4 |
19.86Мб |
| 17 - 1 - The Vertex Cover Problem (9 min).srt |
13.38Кб |
| 17 - 1 - The Vertex Cover Problem (9 min) [abd9c177].mp4 |
12.75Мб |
| 17 - 2 - Smarter Search for Vertex Cover I (10 min).srt |
14.08Кб |
| 17 - 2 - Smarter Search for Vertex Cover I (10 min) [fb8d1d6a] .mp4 |
14.14Мб |
| 17 - 3 - Smarter Search for Vertex Cover II (8 min).srt |
11.43Кб |
| 17 - 3 - Smarter Search for Vertex Cover II (8 min) [8362ddf6] .mp4 |
10.37Мб |
| 17 - 4 - The Traveling Salesman Problem (15 min).srt |
23.17Кб |
| 17 - 4 - The Traveling Salesman Problem (15 min) [d5b10502] .mp4 |
21.00Мб |
| 17 - 5 - A Dynamic Programming Algorithm for TSP (12 min).srt |
18.00Кб |
| 17 - 5 - A Dynamic Programming Algorithm for TSP (12 min) [d3810dbe] .mp4 |
17.45Мб |
| 18 - 1 - A Greedy Knapsack Heuristic (14 min).srt |
21.16Кб |
| 18 - 1 - A Greedy Knapsack Heuristic (14 min) [2b78339f].mp4 |
18.74Мб |
| 18 - 2 - Analysis of a Greedy Knapsack Heuristic I (7 min).srt |
10.17Кб |
| 18 - 2 - Analysis of a Greedy Knapsack Heuristic I (7 min) [afec9276] .mp4 |
8.93Мб |
| 18 - 3 - Analysis of a Greedy Knapsack Heuristic II (10 min).srt |
15.15Кб |
| 18 - 3 - Analysis of a Greedy Knapsack Heuristic II (10 min) [bf43806e] .mp4 |
12.40Мб |
| 18 - 4 - A Dynamic Programming Heuristic for Knapsack (12 min).srt |
17.54Кб |
| 18 - 4 - A Dynamic Programming Heuristic for Knapsack (12 min) [df597ad8] .mp4 |
15.40Мб |
| 18 - 5 - Knapsack via Dynamic Programming, Revisited (10 min) [f1139873] .mp4 |
13.22Мб |
| 18 - 5 - Knapsack via Dynamic Programming Revisited (10 min).srt |
15.50Кб |
| 18 - 6 - Ananysis of Dynamic Programming Heuristic (15 min).srt |
21.34Кб |
| 18 - 6 - Ananysis of Dynamic Programming Heuristic (15 min) [fb7276e9] .mp4 |
18.78Мб |
| 19 - 1 - The Maximum Cut Problem I (9 min).srt |
12.73Кб |
| 19 - 1 - The Maximum Cut Problem I (9 min) [f813dd7f] .mp4 |
12.41Мб |
| 19 - 2 - The Maximum Cut Problem II (9 min).srt |
14.61Кб |
| 19 - 2 - The Maximum Cut Problem II (9 min) [42285a8b] .mp4 |
12.84Мб |
| 19 - 3 - Principles of Local Search I (9 min).srt |
14.45Кб |
| 19 - 3 - Principles of Local Search I (9 min) [f7127cf0] .mp4 |
12.22Мб |
| 19 - 4 - Principles of Local Search II (10 min).srt |
17.70Кб |
| 19 - 4 - Principles of Local Search II (10 min) [26a835d8] .mp4 |
14.49Мб |
| 19 - 5 - The 2-SAT Problem (15 min).srt |
22.38Кб |
| 19 - 5 - The 2-SAT Problem (15 min) [9aa7a458] .mp4 |
19.64Мб |
| 19 - 6 - Random Walks on a Line (16 min).srt |
24.24Кб |
| 19 - 6 - Random Walks on a Line (16 min) [ca621623] .mp4 |
21.33Мб |
| 19 - 7 - Analysis of Papadimitriou's Algorithm (15 min) [0723a39a] .mp4 |
21.80Мб |
| 19 - 7 - Analysis of Papadimitrious Algorithm (15 min).srt |
21.49Кб |
| 20 - 1 - Stable Matching (15 min) [d1eea025] .mp4 |
22.55Мб |
| 20 - 1 - Stable Matching [Optional] (15 min).srt |
19.95Кб |
| 20 - 2 - Matchings, Flows, and Braess's Paradox (14 min) [1b92a84b] .mp4 |
20.96Мб |
| 20 - 2 - Matchings Flows and Braesss Paradox [Optional] (14 min).srt |
19.83Кб |
| 20 - 3 - Linear Programming and Beyond (11 min) [b683a60d] .mp4 |
16.84Мб |
| 20 - 3 - Linear Programming and Beyond [Optional] (11 min).srt |
17.10Кб |
| 20 - 4 - Epilogue (1 min).srt |
1.86Кб |
| 20 - 4 - Epilogue (1 min) [a66483a8] .mp4 |
1.79Мб |
| 2 - 1 - About the Course (17 min) [048ca5a3] .mp4 |
18.33Мб |
| 2 - 1 - About the Course [Part I Review - Optional] (17 min).srt |
31.36Кб |
| 2 - 2 - Introduction Why Study Algorithms (19 min) [aabee07c] .mp4 |
20.25Мб |
| 2 - 2 - Why Study Algorithms [Part I Review - Optional] (19 min).srt |
29.20Кб |
| 2 - 3 - Guiding Principles for Analysis of Algorithms (15 min) [855b56f0] .mp4 |
18.86Мб |
| 2 - 3 - Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).srt |
25.30Кб |
| 2 - 4 - Big-Oh Notation (4 min) [438918e9] .mp4 |
4.36Мб |
| 2 - 4 - Big-Oh Notation [Part I Review - Optional] (4 min).srt |
6.72Кб |
| 2 - 5 - Graph Representations (14 min) [2d064709] .mp4 |
14.48Мб |
| 2 - 5 - Graph Representations [Part I Review - Optional] (14 min).srt |
23.69Кб |
| 2 - 6 - Graph Search - Overview (23 min) [e49996be] .mp4 |
24.36Мб |
| 2 - 6 - Graph Search - Overview [Part I Review - Optional] (23 min).srt |
40.17Кб |
| 2 - 7 - Dijkstras Shortest-Path Algorithm (21 min) [cbc12e6c] .mp4 |
21.92Мб |
| 2 - 7 - Dijkstras Shortest-Path Algorithm [Part I Review - Optional] (21 min).srt |
33.72Кб |
| 2 - 8 - Data Structures Overview (5 min) [2f97a690] .mp4 |
4.89Мб |
| 2 - 8 - Data Structures Overview [Part I Review - Optional] (5).srt |
7.55Кб |
| 2 - 9 - Heaps Operations and Applications (18 min) [ab64ebe3] .mp4 |
19.49Мб |
| 2 - 9 - Heaps Operations and Applications [Part I Review - Optional] (18).srt |
29.94Кб |
| 3 - 1 - Introduction to Greedy Algorithms (13 min).srt |
21.74Кб |
| 3 - 1 - Introduction to Greedy Algorithms (13 min) [79a25644] .mp4 |
18.04Мб |
| 3 - 2 - Application Optimal Caching (11 min).srt |
16.96Кб |
| 3 - 2 - Application Optimal Caching (11 min) [cfe3f405] .mp4 |
14.97Мб |
| 4 - 1 - Problem Definition (6 min).srt |
10.05Кб |
| 4 - 1 - Problem Definition (6 min) [2b4ea5b2] .mp4 |
7.79Мб |
| 4 - 2 - A Greedy Algorithm (13 min).srt |
21.98Кб |
| 4 - 2 - A Greedy Algorithm (13 min) [2974e0a3] .mp4 |
17.16Мб |
| 4 - 3 - Correctness Proof - Part I (7 min).srt |
11.62Кб |
| 4 - 3 - Correctness Proof - Part I (7 min) [b56d6c56] .mp4 |
9.22Мб |
| 4 - 4 - Correctness Proof - Part II (5 min).srt |
6.93Кб |
| 4 - 4 - Correctness Proof - Part II (5 min) [ddab0f06] .mp4 |
6.22Мб |
| 4 - 5 - Handling Ties (7 min) [36e04b70] .mp4 |
9.65Мб |
| 4 - 5 - Handling Ties [Advanced - Optional] (7 min).srt |
11.68Кб |
| 5 - 1 - MST Problem Definition (11 min).srt |
18.16Кб |
| 5 - 1 - MST Problem Definition (11 min) [3682c182] .mp4 |
15.00Мб |
| 5 - 2 - Prim's MST Algorithm (8 min) [5df4b92e] .mp4 |
9.99Мб |
| 5 - 2 - Prims MST Algorithm (8 min).srt |
12.71Кб |
| 5 - 3 - Correctness Proof I (16 min).srt |
23.57Кб |
| 5 - 3 - Correctness Proof I (16 min) [f9f5f689] .mp4 |
19.02Мб |
| 5 - 4 - Correctness Proof II (8 min).srt |
12.70Кб |
| 5 - 4 - Correctness Proof II (8 min) [d5005e55] .mp4 |
10.14Мб |
| 5 - 5 - Proof of Cut Property (12 min) [bf1a2bfb] .mp4 |
14.99Мб |
| 5 - 5 - Proof of Cut Property [Advanced - Optional] (12 min).srt |
19.44Кб |
| 5 - 6 - Fast Implementation I (15 min).srt |
23.47Кб |
| 5 - 6 - Fast Implementation I (15 min) [351642eb] .mp4 |
19.66Мб |
| 5 - 7 - Fast Implementation II (10 min).srt |
15.29Кб |
| 5 - 7 - Fast Implementation II (10 min) [1c4bd5f8] .mp4 |
13.17Мб |
| 6 - 1 - Kruskal's MST Algorithm (8 min) [45de840f] .mp4 |
11.02Мб |
| 6 - 1 - Kruskals MST Algorithm (8 min).srt |
13.30Кб |
| 6 - 2- Correctness of Kruskal's Algorithm (9 min) [0ce1ddba] .mp4 |
12.30Мб |
| 6 - 2 - Correctness of Kruskals Algorithm (9 min).srt |
14.93Кб |
| 6 - 3 - Implementing Kruskal's Algorithm via Union-Find I (9 min) [f2558f1a] .mp4 |
12.90Мб |
| 6 - 3 - Implementing Kruskals Algorithm via Union-Find I (9 min).srt |
15.70Кб |
| 6 - 4 - Implementing Kruskal's Algorithm via Union-Find II (14 min) [6d0f84e6] .mp4 |
18.88Мб |
| 6 - 4 - Implementing Kruskals Algorithm via Union-Find II (14 min).srt |
22.56Кб |
| 6 - 5 - MSTs- State-of-the-Art and Open Questions (9 min) [8b682c9d] .mp4 |
14.23Мб |
| 6 - 5 - MSTs State-of-the-Art and Open Questions [Advanced - Optional] (9 min).srt |
14.95Кб |
| 7 - 1 - Application to Clustering (12 min) [41211bfd] .mp4 |
15.13Мб |
| 7 - 1 - Lazy Unions [Advanced - Optional] (10 min).srt |
16.00Кб |
| 7 - 2 - Correctness of Clustering Algorithm (10 min) [50b9b028] .mp4 |
11.93Мб |
| 7 - 2 - Union-by-Rank [Advanced - Optional] (12 min).srt |
19.68Кб |
| 7 - 3 - Analysis of Union-by-Rank [Advanced - Optional](15).srt |
22.54Кб |
| 7 - 4 - Path Compression [Advanced - Optional] (15).srt |
22.05Кб |
| 7 - 5 - Path Compression The Hopcroft-Ullman Analysis I [Advanced - Optional].srt |
14.13Кб |
| 7 - 6 - Path Compression The Hopcroft-Ullman Analysis II [Advanced - Optional].srt |
17.28Кб |
| 7 - 7 - The Ackermann Function [Advanced - Optional](17 min).srt |
21.75Кб |
| 7 - 8 - Path Compression Tarjans Analysis I [Advanced - Optional].srt |
21.17Кб |
| 7 - 9 - Path Compression Tarjans Analysis II [Advanced - Optional].srt |
19.71Кб |
| 8 - 1 - Introduction and Motivation (9 min).srt |
14.36Кб |
| 8 - 1 - Lazy Unions (10 min) [c45fabb9] .mp4 |
15.24Мб |
| 8 - 2 - Problem Definition (10 min).srt |
15.48Кб |
| 8 - 2 - Union-by-Rank (12 min) [324f41a7] .mp4 |
18.19Мб |
| 8 - 3 - A Greedy Algorithm (17 min).srt |
26.41Кб |
| 8 - 3 - Analysis of Union-by-Rank (15 min) [40e822a2] .mp4 |
22.29Мб |
| 8 - 4 - Path Compression (15 min) [f168bafc] .mp4 |
21.51Мб |
| 8 - 5 - Correctness Proof I (10 min).srt |
15.76Кб |
| 8 - 5 - The Hopcroft-Ullman Analysis I (9 min) [9d26faef] .mp4 |
13.66Мб |
| 8 - 6 - Correctness Proof II (13 min).srt |
20.89Кб |
| 8 - 6 - The Hopcroft-Ullman Analysis II (12 min) [6dd9994f] .mp4 |
17.17Мб |
| 8 - 7 - The Ackermann Function (16 min) [82173278] .mp4 |
22.64Мб |
| 8 - 8 - Tarjan's Analysis I (14 min) [8fb3c716] .mp4 |
20.78Мб |
| 8 - 9 - Tarjan's Analysis II (14 min) [f4ca2e27] .mp4 |
19.09Мб |
| 9 - 1 - Introduction and Motivation (9 min) [c3fa5362] .mp4 |
11.89Мб |
| 9 - 1 - Introduction Weighted Independent Sets in Path Graphs (8 min).srt |
13.06Кб |
| 9 - 2 - Problem Definition (10 min) [a45565a8] .mp4 |
15.35Мб |
| 9 - 2 - WIS in Path Graphs Optimal Substructure (9 min).srt |
13.60Кб |
| 9 - 3 - A Greedy Algorithm (17 min) [16506eac] .mp4 |
24.70Мб |
| 9 - 3 - WIS in Path Graphs A Linear-Time Algorithm (10 min).srt |
15.57Кб |
| 9 - 4 - Correctness Proof I (10 min) [9340eb0d] .mp4 |
13.30Мб |
| 9 - 4 - WIS in Path Graphs A Reconstruction Algorithm (7 min).srt |
11.00Кб |
| 9 - 5 - Correctness Proof II (13 min) [5a973fb7] .mp4 |
16.75Мб |
| 9 - 5 - Principles of Dynamic Programming (8 min).srt |
12.36Кб |