Pavan Ravi
19 7 Analysis of Papadimitriou 's Algorithm 15 min
14:44
Pavan Ravi
20 1 Stable Matching Optional 15 min
15:13
Pavan Ravi
20 2 Matchings, Flows, and Braess 's Paradox Optional 14 min
13:56
Pavan Ravi
20 3 Linear Programming and Beyond Optional 11 min
11:26
Pavan Ravi
19 6 Random Walks on a Line 16 min
16:12
Pavan Ravi
15 4 A Reweighting Technique 14 min
14:14
Pavan Ravi
18 6 Ananysis of Dynamic Programming Heuristic 15 min
15:13
Pavan Ravi
19 3 Principles of Local Search I 9 min
9:00
Pavan Ravi
16 1 Polynomial Time Solvable Problems 14 min
14:30
Pavan Ravi
18 1 A Greedy Knapsack Heuristic 14 min
14:02
Pavan Ravi
17 4 The Traveling Salesman Problem 15 min
14:58
Pavan Ravi
19 5 The 2 SAT Problem 15 min
14:34
Pavan Ravi
19 4 Principles of Local Search II 10 min
10:26
Pavan Ravi
18 4 A Dynamic Programming Heuristic for Knapsack 12 min
11:38
Pavan Ravi
19 2 The Maximum Cut Problem II 9 min
9:19
Pavan Ravi
18 5 Knapsack via Dynamic Programming, Revisited 10 min
10:26
Pavan Ravi
19 1 The Maximum Cut Problem I 9 min
8:29
Pavan Ravi
17 5 A Dynamic Programming Algorithm for TSP 12 min
12:15
Pavan Ravi
20 4 Epilogue 1 min
1:05
Pavan Ravi
18 2 Analysis of a Greedy Knapsack Heuristic I 7 min
7:13
Pavan Ravi
18 3 Analysis of a Greedy Knapsack Heuristic II 10 min
9:43
Pavan Ravi
17 2 Smarter Search for Vertex Cover I 10 min
9:40
Pavan Ravi
16 2 Reductions and Completeness 14 min
13:32
Pavan Ravi
17 1 The Vertex Cover Problem 9 min
8:55
Pavan Ravi
14 6 A Space Optimization 12 min
12:34
Pavan Ravi
15 3 The Floyd Warshall Algorithm 13 min
13:30
Pavan Ravi
17 3 Smarter Search for Vertex Cover II 8 min
7:42
Pavan Ravi
16 3 Definition and Interpretation of NP Completeness I 11 min
10:59
Pavan Ravi
15 2 Optimal Substructure 12 min
12:03
Pavan Ravi
15 5 Johnson 's Algorithm I 11 min
11:16
Pavan Ravi
16 4 Definition and Interpretation of NP Completeness II 8 min
7:36
Pavan Ravi
15 6 Johnson 's Algorithm II 11 min
11:36
Pavan Ravi
14 2 Optimal Substructure 11 min
10:47
Pavan Ravi
13 1 Problem Definition 12 min
12:25
Pavan Ravi
12 2 A Dynamic Programming Algorithm 12 min
12:29
Pavan Ravi
14 5 Detecting Negative Cycles 9 min
9:19
Pavan Ravi
14 7 Internet Routing I Optional 11 min
11:29
Pavan Ravi
14 4 The Basic Algorithm II 11 min
10:56
Pavan Ravi
14 8 Internet Routing II Optional 7 min
7:00
Pavan Ravi
15 1 Problem Definition 7 min
7:02
Pavan Ravi
14 1 Single Source Shortest Paths, Revisted 11 min
10:52
Pavan Ravi
13 4 A Dynamic Programming Algorithm I 10 min
9:46
Pavan Ravi
12 1 Optimal Substructure 14 min
13:44
Pavan Ravi
14 3 The Basic Algorithm I 9 min
8:36
Pavan Ravi
13 5 A Dynamic Programming Algorithm II 9 min
9:28
Pavan Ravi
9 3 A Greedy Algorithm 17 min
16:43
Pavan Ravi
11 3 Example Review Optional 14 min
12:54
Pavan Ravi
11 2 A Dynamic Programming Algorithm 10 min
9:59
Pavan Ravi
13 3 Proof of Optimal Substructure 7 min
6:41
Pavan Ravi
13 2 Optimal Substructure 9 min
9:34
Pavan Ravi
9 6 Correctness Proof II 13 min
12:47
Pavan Ravi
10 3 WIS in Path Graphs A Linear Time Algorithm 10 min
9:57
Pavan Ravi
8 7 The Ackermann Function Advanced Optional 17 min
16:08
Pavan Ravi
11 1 The Knapsack Problem 10 min
9:48
Pavan Ravi
10 2 WIS in Path Graphs Optimal Substructure 9 min
9:27
Pavan Ravi
9 2 Problem Definition 10 min
10:18
Pavan Ravi
9 5 Correctness Proof I 10 min
10:07
Pavan Ravi
10 4 WIS in Path Graphs A Reconstruction Algorithm 7 min
6:53
Pavan Ravi
8 4 Path Compression Advanced Optional 15 min
14:40
Pavan Ravi
8 9 Path Compression Tarjan 's Analysis II Advanced Optional 14 min
13:46
Pavan Ravi
10 1 Introduction Weighted Independent Sets in Path Graphs 8 min
7:56
Pavan Ravi
8 8 Path Compression Tarjan 's Analysis I Advanced Optional 14 min
14:11
Pavan Ravi
8 5 Path Compression The Hopcroft Ullman Analysis I Advanced Optional 9 min
9:26
Pavan Ravi
8 3 Analysis of Union by Rank Advanced Optional 15 min
14:56
Pavan Ravi
8 2 Union by Rank Advanced Optional 12 min
12:24
Pavan Ravi
8 6 Path Compression The Hopcroft Ullman Analysis II Advanced Optional 12 min
11:40
Pavan Ravi
6 4 Implementing Kruskal 's Algorithm via Union Find II 14 min
13:36
Pavan Ravi
9 4 A More Complex Example 4 min
4:03
Pavan Ravi
8 1 Lazy Unions Advanced Optional 10 min
10:03
Pavan Ravi
7 2 Correctness of Clustering Algorithm 10 min
9:58
Pavan Ravi
7 1 Application to Clustering 12 min
11:33
Pavan Ravi
6 5 MSTs State of the Art and Open Questions Advanced Optional 9 min
9:17
Pavan Ravi
5 6 Fast Implementation I 15 min
14:49
Pavan Ravi
5 7 Fast Implementation II 10 min
9:51
Pavan Ravi
6 3 Implementing Kruskal 's Algorithm via Union Find I 9 min
9:22
Pavan Ravi
5 3 Correctness Proof I 16 min
15:30
Pavan Ravi
6 2 Correctness of Kruskal 's Algorithm 9 min
9:22
Pavan Ravi
5 5 Proof of Cut Property Advanced Optional 12 min
11:53
Pavan Ravi
5 2 Prim 's MST Algorithm 8 min
7:33
Pavan Ravi
4 2 A Greedy Algorithm 13 min
12:57
Pavan Ravi
6 1 Kruskal 's MST Algorithm 8 min
7:28
Pavan Ravi
5 1 MST Problem Definition 11 min
11:17
Pavan Ravi
5 4 Correctness Proof II 8 min
8:10
Pavan Ravi
2 3 Guiding Principles for Analysis of Algorithms Part I Review Optional 15 min
15:17
Pavan Ravi
4 3 Correctness Proof Part I 7 min
6:58
Pavan Ravi
3 2 Application Optimal Caching 11 min
10:43
Pavan Ravi
4 5 Handling Ties Advanced Optional 7 min
7:15
Pavan Ravi
4 1 Problem Definition 6 min
5:49
Pavan Ravi
4 4 Correctness Proof Part II 5 min
4:41
Pavan Ravi
2 5 Graph Representations Part I Review Optional 14 min
14:23
Pavan Ravi
2 4 Big Oh Notation Part I Review Optional 4 min
4:10
Pavan Ravi
2 8 Data Structures Overview Part I Review Optional 5 min
4:37