|
Please note that this page does not hosts or makes available any of the listed filenames. You
cannot download any of those files from here.
|
| 0_Final_Exam.html |
31.74KB |
| 0_Problem_Set_1.html |
143.76KB |
| 01_A_Greedy_Knapsack_Heuristic_14_min_0_Slides_PDF.pdf |
2.06MB |
| 01_A_Greedy_Knapsack_Heuristic_14_min.mp4 |
18.74MB |
| 01_A_Greedy_Knapsack_Heuristic_14_min.pdf |
124.50KB |
| 01_A_Greedy_Knapsack_Heuristic_14_min.srt |
21.16KB |
| 01_A_Greedy_Knapsack_Heuristic_14_min.txt |
14.12KB |
| 01_About_the_Course_Part_I_Review_-_Optional_17_min_0_Slides_PDF.pdf |
209.06KB |
| 01_About_the_Course_Part_I_Review_-_Optional_17_min.mp4 |
18.33MB |
| 01_About_the_Course_Part_I_Review_-_Optional_17_min.pdf |
731.44KB |
| 01_About_the_Course_Part_I_Review_-_Optional_17_min.srt |
31.36KB |
| 01_About_the_Course_Part_I_Review_-_Optional_17_min.txt |
20.87KB |
| 01_Application-_Internet_Routing_11_min_0_Slides_PDF.pdf |
1.41MB |
| 01_Application-_Internet_Routing_11_min.mp4 |
13.85MB |
| 01_Application-_Internet_Routing_11_min.pdf |
90.85KB |
| 01_Application-_Internet_Routing_11_min.srt |
17.78KB |
| 01_Application-_Internet_Routing_11_min.txt |
11.97KB |
| 01_Application_to_Clustering_12_min_0_Slides_PDF.pdf |
1.79MB |
| 01_Application_to_Clustering_12_min.mp4 |
15.13MB |
| 01_Application_to_Clustering_12_min.pdf |
134.01KB |
| 01_Application_to_Clustering_12_min.srt |
18.49KB |
| 01_Application_to_Clustering_12_min.txt |
12.28KB |
| 01_Introduction_and_Motivation_9_min_0_Slides_PDF.pdf |
1.66MB |
| 01_Introduction_and_Motivation_9_min.mp4 |
11.89MB |
| 01_Introduction_and_Motivation_9_min.pdf |
99.10KB |
| 01_Introduction_and_Motivation_9_min.srt |
14.36KB |
| 01_Introduction_and_Motivation_9_min.txt |
9.55KB |
| 01_Introduction_to_Greedy_Algorithms_13_min_0_Slides_PDF.pdf |
1.75MB |
| 01_Introduction_to_Greedy_Algorithms_13_min.mp4 |
18.04MB |
| 01_Introduction_to_Greedy_Algorithms_13_min.pdf |
91.29KB |
| 01_Introduction_to_Greedy_Algorithms_13_min.srt |
21.74KB |
| 01_Introduction_to_Greedy_Algorithms_13_min.txt |
14.49KB |
| 01 Introduction- Weighted Independent Sets in Path Graphs 8 min 0 Slides PDF pdf |
1.18MB |
| 01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.mp4 |
11.26MB |
| 01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.pdf |
102.09KB |
| 01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.srt |
13.06KB |
| 01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.txt |
8.66KB |
| 01_Kruskals_MST_Algorithm_8_min_0_Slides_PDF.pdf |
751.67KB |
| 01_Kruskals_MST_Algorithm_8_min.mp4 |
11.02MB |
| 01_Kruskals_MST_Algorithm_8_min.pdf |
104.91KB |
| 01_Kruskals_MST_Algorithm_8_min.srt |
13.30KB |
| 01_Kruskals_MST_Algorithm_8_min.txt |
8.79KB |
| 01_Lazy_Unions_Advanced_-_Optional_10_min_0_Slides_PDF.pdf |
1.64MB |
| 01_Lazy_Unions_Advanced_-_Optional_10_min.mp4 |
15.24MB |
| 01_Lazy_Unions_Advanced_-_Optional_10_min.pdf |
137.32KB |
| 01_Lazy_Unions_Advanced_-_Optional_10_min.srt |
16.00KB |
| 01_Lazy_Unions_Advanced_-_Optional_10_min.txt |
10.67KB |
| 01_MST_Problem_Definition_11_min_0_Slides_PDF.pdf |
1.61MB |
| 01_MST_Problem_Definition_11_min.mp4 |
15.00MB |
| 01_MST_Problem_Definition_11_min.pdf |
117.92KB |
| 01_MST_Problem_Definition_11_min.srt |
18.16KB |
| 01_MST_Problem_Definition_11_min.txt |
12.18KB |
| 01_Optimal_Substructure_14_min_0_Slides_PDF.pdf |
2.36MB |
| 01_Optimal_Substructure_14_min.mp4 |
19.54MB |
| 01_Optimal_Substructure_14_min.pdf |
142.34KB |
| 01_Optimal_Substructure_14_min.srt |
21.10KB |
| 01_Optimal_Substructure_14_min.txt |
14.06KB |
| 01_Polynomial-Time_Solvable_Problems_14_min_0_Slides_PDF.pdf |
1.86MB |
| 01_Polynomial-Time_Solvable_Problems_14_min.mp4 |
20.49MB |
| 01_Polynomial-Time_Solvable_Problems_14_min.pdf |
124.52KB |
| 01_Polynomial-Time_Solvable_Problems_14_min.srt |
21.39KB |
| 01_Polynomial-Time_Solvable_Problems_14_min.txt |
14.35KB |
| 01_Problem_Definition_12_min_0_Slides_PDF.pdf |
1.94MB |
| 01_Problem_Definition_12_min.mp4 |
17.19MB |
| 01_Problem_Definition_12_min.pdf |
161.37KB |
| 01_Problem_Definition_12_min.srt |
20.18KB |
| 01_Problem_Definition_12_min.txt |
13.55KB |
| 01_Problem_Definition_6_min_0_Slides_PDF.pdf |
944.12KB |
| 01_Problem_Definition_6_min.mp4 |
7.79MB |
| 01_Problem_Definition_6_min.pdf |
112.19KB |
| 01_Problem_Definition_6_min.srt |
10.05KB |
| 01_Problem_Definition_6_min.txt |
6.74KB |
| 01_Problem_Definition_7_min_0_Slides_PDF.pdf |
1.00MB |
| 01_Problem_Definition_7_min.mp4 |
9.48MB |
| 01_Problem_Definition_7_min.pdf |
111.64KB |
| 01_Problem_Definition_7_min.srt |
11.12KB |
| 01_Problem_Definition_7_min.txt |
7.40KB |
| 01_Single-Source_Shortest_Paths_Revisted_11_min_0_Slides_PDF.pdf |
1.82MB |
| 01_Single-Source_Shortest_Paths_Revisted_11_min.mp4 |
15.15MB |
| 01_Single-Source_Shortest_Paths_Revisted_11_min.pdf |
118.34KB |
| 01_Single-Source_Shortest_Paths_Revisted_11_min.srt |
17.50KB |
| 01_Single-Source_Shortest_Paths_Revisted_11_min.txt |
11.79KB |
| 01_Stable_Matching_Optional_15_min_0_Slides_PDF.pdf |
5.15MB |
| 01_Stable_Matching_Optional_15_min.mp4 |
22.55MB |
| 01_Stable_Matching_Optional_15_min.pdf |
160.65KB |
| 01_Stable_Matching_Optional_15_min.srt |
19.95KB |
| 01_Stable_Matching_Optional_15_min.txt |
13.25KB |
| 01_The_Knapsack_Problem_10_min_0_Slides_PDF.pdf |
1.48MB |
| 01_The_Knapsack_Problem_10_min.mp4 |
14.08MB |
| 01_The_Knapsack_Problem_10_min.pdf |
119.46KB |
| 01_The_Knapsack_Problem_10_min.srt |
14.41KB |
| 01_The_Knapsack_Problem_10_min.txt |
9.63KB |
| 01_The_Maximum_Cut_Problem_I_9_min_0_Slides_PDF.pdf |
3.06MB |
| 01_The_Maximum_Cut_Problem_I_9_min.mp4 |
12.41MB |
| 01_The_Maximum_Cut_Problem_I_9_min.pdf |
194.58KB |
| 01_The_Maximum_Cut_Problem_I_9_min.srt |
12.73KB |
| 01_The_Maximum_Cut_Problem_I_9_min.txt |
8.60KB |
| 01_The_Vertex_Cover_Problem_9_min_0_Slides_PDF.pdf |
1.20MB |
| 01_The_Vertex_Cover_Problem_9_min.mp4 |
12.75MB |
| 01_The_Vertex_Cover_Problem_9_min.pdf |
109.62KB |
| 01_The_Vertex_Cover_Problem_9_min.srt |
13.38KB |
| 01_The_Vertex_Cover_Problem_9_min.txt |
8.94KB |
| 02_A_Dynamic_Programming_Algorithm_10_min_0_Slides_PDF.pdf |
1.42MB |
| 02_A_Dynamic_Programming_Algorithm_10_min.mp4 |
13.61MB |
| 02_A_Dynamic_Programming_Algorithm_10_min.pdf |
120.94KB |
| 02_A_Dynamic_Programming_Algorithm_10_min.srt |
14.83KB |
| 02_A_Dynamic_Programming_Algorithm_10_min.txt |
9.88KB |
| 02_A_Dynamic_Programming_Algorithm_12_min_0_Slides_PDF.pdf |
2.25MB |
| 02_A_Dynamic_Programming_Algorithm_12_min.mp4 |
16.71MB |
| 02_A_Dynamic_Programming_Algorithm_12_min.pdf |
156.82KB |
| 02_A_Dynamic_Programming_Algorithm_12_min.srt |
19.11KB |
| 02_A_Dynamic_Programming_Algorithm_12_min.txt |
12.83KB |
| 02_A_Greedy_Algorithm_13_min_0_Slides_PDF.pdf |
1.63MB |
| 02_A_Greedy_Algorithm_13_min.mp4 |
17.16MB |
| 02_A_Greedy_Algorithm_13_min.pdf |
113.48KB |
| 02_A_Greedy_Algorithm_13_min.srt |
21.98KB |
| 02_A_Greedy_Algorithm_13_min.txt |
14.63KB |
| 02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min_0_Slides_PDF.pdf |
2.72MB |
| 02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.mp4 |
8.93MB |
| 02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.pdf |
152.30KB |
| 02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.srt |
10.17KB |
| 02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.txt |
6.79KB |
| 02_Application-_Optimal_Caching_11_min_0_Slides_PDF.pdf |
1.14MB |
| 02_Application-_Optimal_Caching_11_min.mp4 |
14.97MB |
| 02_Application-_Optimal_Caching_11_min.pdf |
81.63KB |
| 02_Application-_Optimal_Caching_11_min.srt |
16.96KB |
| 02_Application-_Optimal_Caching_11_min.txt |
11.29KB |
| 02_Application-_Sequence_Alignment_9_min_0_Slides_PDF.pdf |
2.11MB |
| 02_Application-_Sequence_Alignment_9_min.mp4 |
11.10MB |
| 02_Application-_Sequence_Alignment_9_min.pdf |
102.40KB |
| 02_Application-_Sequence_Alignment_9_min.srt |
13.35KB |
| 02_Application-_Sequence_Alignment_9_min.txt |
8.91KB |
| 02_Correctness_of_Clustering_Algorithm_10_min_0_Slides_PDF.pdf |
1.62MB |
| 02_Correctness_of_Clustering_Algorithm_10_min.mp4 |
11.93MB |
| 02_Correctness_of_Clustering_Algorithm_10_min.pdf |
142.45KB |
| 02_Correctness_of_Clustering_Algorithm_10_min.srt |
16.36KB |
| 02_Correctness_of_Clustering_Algorithm_10_min.txt |
10.86KB |
| 02_Correctness_of_Kruskals_Algorithm_9_min_0_Slides_PDF.pdf |
1.56MB |
| 02_Correctness_of_Kruskals_Algorithm_9_min.mp4 |
12.30MB |
| 02_Correctness_of_Kruskals_Algorithm_9_min.pdf |
118.62KB |
| 02_Correctness_of_Kruskals_Algorithm_9_min.srt |
14.93KB |
| 02_Correctness_of_Kruskals_Algorithm_9_min.txt |
9.91KB |
| 02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min_0_Slides_PDF.pdf |
5.15MB |
| 02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.mp4 |
20.96MB |
| 02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.pdf |
160.65KB |
| 02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.srt |
19.83KB |
| 02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.txt |
13.34KB |
| 02_Optimal_Substructure_11_min_0_Slides_PDF.pdf |
1.95MB |
| 02_Optimal_Substructure_11_min.mp4 |
15.27MB |
| 02_Optimal_Substructure_11_min.pdf |
132.89KB |
| 02_Optimal_Substructure_11_min.srt |
16.47KB |
| 02_Optimal_Substructure_11_min.txt |
11.04KB |
| 02_Optimal_Substructure_12_min_0_Slides_PDF.pdf |
1.87MB |
| 02_Optimal_Substructure_12_min.mp4 |
16.53MB |
| 02_Optimal_Substructure_12_min.pdf |
136.74KB |
| 02_Optimal_Substructure_12_min.srt |
19.76KB |
| 02_Optimal_Substructure_12_min.txt |
13.13KB |
| 02_Optimal_Substructure_9_min_0_Slides_PDF.pdf |
3.29MB |
| 02_Optimal_Substructure_9_min.mp4 |
13.94MB |
| 02_Optimal_Substructure_9_min.pdf |
172.51KB |
| 02_Optimal_Substructure_9_min.srt |
15.57KB |
| 02_Optimal_Substructure_9_min.txt |
10.41KB |
| 02_Prims_MST_Algorithm_8_min_0_Slides_PDF.pdf |
1.10MB |
| 02_Prims_MST_Algorithm_8_min.mp4 |
9.99MB |
| 02_Prims_MST_Algorithm_8_min.pdf |
105.28KB |
| 02_Prims_MST_Algorithm_8_min.srt |
12.71KB |
| 02_Prims_MST_Algorithm_8_min.txt |
8.51KB |
| 02_Problem_Definition_10_min_0_Slides_PDF.pdf |
1.89MB |
| 02_Problem_Definition_10_min.mp4 |
15.35MB |
| 02_Problem_Definition_10_min.pdf |
163.75KB |
| 02_Problem_Definition_10_min.srt |
15.48KB |
| 02_Problem_Definition_10_min.txt |
10.33KB |
| 02_Reductions_and_Completeness_14_min_0_Slides_PDF.pdf |
1.75MB |
| 02_Reductions_and_Completeness_14_min.mp4 |
19.86MB |
| 02_Reductions_and_Completeness_14_min.pdf |
82.99KB |
| 02_Reductions_and_Completeness_14_min.srt |
19.92KB |
| 02_Reductions_and_Completeness_14_min.txt |
13.33KB |
| 02_Smarter_Search_for_Vertex_Cover_I_10_min_0_Slides_PDF.pdf |
2.69MB |
| 02_Smarter_Search_for_Vertex_Cover_I_10_min.mp4 |
14.14MB |
| 02_Smarter_Search_for_Vertex_Cover_I_10_min.pdf |
151.50KB |
| 02_Smarter_Search_for_Vertex_Cover_I_10_min.srt |
14.07KB |
| 02_Smarter_Search_for_Vertex_Cover_I_10_min.txt |
9.46KB |
| 02_The_Maximum_Cut_Problem_II_9_min_0_Slides_PDF.pdf |
3.06MB |
| 02_The_Maximum_Cut_Problem_II_9_min.mp4 |
12.84MB |
| 02_The_Maximum_Cut_Problem_II_9_min.pdf |
194.58KB |
| 02_The_Maximum_Cut_Problem_II_9_min.srt |
14.61KB |
| 02_The_Maximum_Cut_Problem_II_9_min.txt |
9.86KB |
| 02_Union-by-Rank_Advanced_-_Optional_12_min_0_Slides_PDF.pdf |
2.12MB |
| 02_Union-by-Rank_Advanced_-_Optional_12_min.mp4 |
18.19MB |
| 02_Union-by-Rank_Advanced_-_Optional_12_min.pdf |
151.31KB |
| 02_Union-by-Rank_Advanced_-_Optional_12_min.srt |
19.68KB |
| 02_Union-by-Rank_Advanced_-_Optional_12_min.txt |
13.12KB |
| 02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min_0_Slides_PDF.pdf |
1.23MB |
| 02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.mp4 |
20.25MB |
| 02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.pdf |
729.13KB |
| 02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.srt |
29.20KB |
| 02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.txt |
19.49KB |
| 02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min_0_Slides_PDF.pdf |
1.67MB |
| 02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.mp4 |
13.52MB |
| 02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.pdf |
130.46KB |
| 02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.srt |
13.60KB |
| 02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.txt |
9.09KB |
| 03_A_Greedy_Algorithm_17_min_0_Slides_PDF.pdf |
2.68MB |
| 03_A_Greedy_Algorithm_17_min.mp4 |
24.70MB |
| 03_A_Greedy_Algorithm_17_min.pdf |
183.61KB |
| 03_A_Greedy_Algorithm_17_min.srt |
26.41KB |
| 03_A_Greedy_Algorithm_17_min.txt |
17.56KB |
| 03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min_0_Slides_PDF.pdf |
2.72MB |
| 03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.mp4 |
12.40MB |
| 03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.pdf |
152.30KB |
| 03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.srt |
15.15KB |
| 03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.txt |
10.16KB |
| 03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min_0_Slides_PDF.pdf |
2.66MB |
| 03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.mp4 |
22.29MB |
| 03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.pdf |
142.48KB |
| 03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.srt |
22.54KB |
| 03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.txt |
15.02KB |
| 03_Correctness_Proof_-_Part_I_7_min_0_Slides_PDF.pdf |
1.33MB |
| 03_Correctness_Proof_-_Part_I_7_min.mp4 |
9.22MB |
| 03_Correctness_Proof_-_Part_I_7_min.pdf |
112.13KB |
| 03_Correctness_Proof_-_Part_I_7_min.srt |
11.62KB |
| 03_Correctness_Proof_-_Part_I_7_min.txt |
7.80KB |
| 03_Correctness_Proof_I_16_min_0_Slides_PDF.pdf |
2.46MB |
| 03_Correctness_Proof_I_16_min.mp4 |
19.02MB |
| 03_Correctness_Proof_I_16_min.pdf |
144.67KB |
| 03_Correctness_Proof_I_16_min.srt |
23.57KB |
| 03_Correctness_Proof_I_16_min.txt |
15.51KB |
| 03 Definition and Interpretation of NP-Completeness I 11 min 0 Slides PDF pdf |
2.21MB |
| 03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.mp4 |
16.35MB |
| 03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.pdf |
91.20KB |
| 03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.srt |
15.75KB |
| 03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.txt |
10.59KB |
| 03_Example_Review_-_Optional_14_min_0_Slides_PDF.pdf |
769.69KB |
| 03_Example_Review_-_Optional_14_min.mp4 |
24.21MB |
| 03_Example_Review_-_Optional_14_min.pdf |
139.91KB |
| 03_Example_Review_-_Optional_14_min.srt |
21.55KB |
| 03_Example_Review_-_Optional_14_min.txt |
12.91KB |
| 03 Guiding Principles for Analysis of Algorithms Part I Review - Optional 15 min 0 Slides PDF pdf |
1.41MB |
| 03 Guiding Principles for Analysis of Algorithms Part I Review - Optional 15 min mp4 |
18.86MB |
| 03 Guiding Principles for Analysis of Algorithms Part I Review - Optional 15 min pdf |
554.01KB |
| 03 Guiding Principles for Analysis of Algorithms Part I Review - Optional 15 min srt |
25.29KB |
| 03 Guiding Principles for Analysis of Algorithms Part I Review - Optional 15 min txt |
16.96KB |
| 03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min_0_Slides_PDF.pdf |
3.41MB |
| 03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.mp4 |
12.90MB |
| 03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.pdf |
138.48KB |
| 03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.srt |
15.70KB |
| 03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.txt |
10.44KB |
| 03_Linear_Programming_and_Beyond_Optional_11_min_0_Slides_PDF.pdf |
5.15MB |
| 03_Linear_Programming_and_Beyond_Optional_11_min.mp4 |
16.84MB |
| 03_Linear_Programming_and_Beyond_Optional_11_min.pdf |
160.65KB |
| 03_Linear_Programming_and_Beyond_Optional_11_min.srt |
17.10KB |
| 03_Linear_Programming_and_Beyond_Optional_11_min.txt |
11.46KB |
| 03_Principles_of_Local_Search_I_9_min_0_Slides_PDF.pdf |
2.66MB |
| 03_Principles_of_Local_Search_I_9_min.mp4 |
12.22MB |
| 03_Principles_of_Local_Search_I_9_min.pdf |
110.94KB |
| 03_Principles_of_Local_Search_I_9_min.srt |
14.45KB |
| 03_Principles_of_Local_Search_I_9_min.txt |
9.71KB |
| 03_Proof_of_Optimal_Substructure_7_min_0_Slides_PDF.pdf |
3.29MB |
| 03_Proof_of_Optimal_Substructure_7_min.mp4 |
9.86MB |
| 03_Proof_of_Optimal_Substructure_7_min.pdf |
172.51KB |
| 03_Proof_of_Optimal_Substructure_7_min.srt |
9.71KB |
| 03_Proof_of_Optimal_Substructure_7_min.txt |
6.53KB |
| 03_Smarter_Search_for_Vertex_Cover_II_8_min_0_Slides_PDF.pdf |
2.69MB |
| 03_Smarter_Search_for_Vertex_Cover_II_8_min.mp4 |
10.37MB |
| 03_Smarter_Search_for_Vertex_Cover_II_8_min.pdf |
151.50KB |
| 03_Smarter_Search_for_Vertex_Cover_II_8_min.srt |
11.43KB |
| 03_Smarter_Search_for_Vertex_Cover_II_8_min.txt |
7.71KB |
| 03_The_Basic_Algorithm_I_9_min_0_Slides_PDF.pdf |
2.30MB |
| 03_The_Basic_Algorithm_I_9_min.mp4 |
12.11MB |
| 03_The_Basic_Algorithm_I_9_min.pdf |
189.03KB |
| 03_The_Basic_Algorithm_I_9_min.srt |
12.52KB |
| 03_The_Basic_Algorithm_I_9_min.txt |
8.52KB |
| 03_The_Floyd-Warshall_Algorithm_13_min_0_Slides_PDF.pdf |
1.87MB |
| 03_The_Floyd-Warshall_Algorithm_13_min.mp4 |
18.89MB |
| 03_The_Floyd-Warshall_Algorithm_13_min.pdf |
128.02KB |
| 03_The_Floyd-Warshall_Algorithm_13_min.srt |
21.63KB |
| 03_The_Floyd-Warshall_Algorithm_13_min.txt |
14.53KB |
| 03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min_0_Slides_PDF.pdf |
1.60MB |
| 03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.mp4 |
14.54MB |
| 03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.pdf |
122.32KB |
| 03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.srt |
15.57KB |
| 03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.txt |
10.38KB |
| 04_A_Dynamic_Programming_Algorithm_I_10_min_0_Slides_PDF.pdf |
2.84MB |
| 04_A_Dynamic_Programming_Algorithm_I_10_min.mp4 |
14.05MB |
| 04_A_Dynamic_Programming_Algorithm_I_10_min.pdf |
227.07KB |
| 04_A_Dynamic_Programming_Algorithm_I_10_min.srt |
16.26KB |
| 04_A_Dynamic_Programming_Algorithm_I_10_min.txt |
10.83KB |
| 04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min_0_Slides_PDF.pdf |
1.66MB |
| 04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.mp4 |
15.41MB |
| 04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.pdf |
106.62KB |
| 04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.srt |
17.54KB |
| 04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.txt |
11.80KB |
| 04_A_More_Complex_Example_4_min_0_Slides_PDF.pdf |
807.83KB |
| 04_A_More_Complex_Example_4_min.mp4 |
5.51MB |
| 04_A_More_Complex_Example_4_min.pdf |
85.91KB |
| 04_A_More_Complex_Example_4_min.srt |
5.02KB |
| 04_A_More_Complex_Example_4_min.txt |
3.37KB |
| 04_A_Reweighting_Technique_14_min_0_Slides_PDF.pdf |
2.43MB |
| 04_A_Reweighting_Technique_14_min.mp4 |
19.62MB |
| 04_A_Reweighting_Technique_14_min.pdf |
183.28KB |
| 04_A_Reweighting_Technique_14_min.srt |
20.57KB |
| 04_A_Reweighting_Technique_14_min.txt |
13.71KB |
| 04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min_0_Slides_PDF.pdf |
660.31KB |
| 04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.mp4 |
4.36MB |
| 04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.pdf |
812.01KB |
| 04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.srt |
6.71KB |
| 04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.txt |
4.47KB |
| 04_Correctness_Proof_-_Part_II_5_min_0_Slides_PDF.pdf |
950.25KB |
| 04_Correctness_Proof_-_Part_II_5_min.mp4 |
6.22MB |
| 04_Correctness_Proof_-_Part_II_5_min.pdf |
111.74KB |
| 04_Correctness_Proof_-_Part_II_5_min.srt |
6.93KB |
| 04_Correctness_Proof_-_Part_II_5_min.txt |
4.64KB |
| 04_Correctness_Proof_II_8_min_0_Slides_PDF.pdf |
1.06MB |
| 04_Correctness_Proof_II_8_min.mp4 |
10.14MB |
| 04_Correctness_Proof_II_8_min.pdf |
113.70KB |
| 04_Correctness_Proof_II_8_min.srt |
12.69KB |
| 04_Correctness_Proof_II_8_min.txt |
8.43KB |
| 04 Definition and Interpretation of NP-Completeness II 8 min 0 Slides PDF pdf |
2.21MB |
| 04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.mp4 |
12.18MB |
| 04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.pdf |
91.20KB |
| 04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.srt |
11.65KB |
| 04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.txt |
7.86KB |
| 04_Epilogue_1_min.mp4 |
1.79MB |
| 04_Epilogue_1_min.srt |
1.86KB |
| 04_Epilogue_1_min.txt |
1.24KB |
| 04 Implementing Kruskals Algorithm via Union-Find II 14 min 0 Slides PDF pdf |
3.41MB |
| 04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.mp4 |
18.88MB |
| 04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.pdf |
138.48KB |
| 04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.srt |
22.56KB |
| 04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.txt |
14.91KB |
| 04_Path_Compression_Advanced_-_Optional_15_min_0_Slides_PDF.pdf |
1.99MB |
| 04_Path_Compression_Advanced_-_Optional_15_min.mp4 |
21.51MB |
| 04_Path_Compression_Advanced_-_Optional_15_min.pdf |
141.34KB |
| 04_Path_Compression_Advanced_-_Optional_15_min.srt |
22.05KB |
| 04_Path_Compression_Advanced_-_Optional_15_min.txt |
14.67KB |
| 04_Principles_of_Local_Search_II_10_min_0_Slides_PDF.pdf |
2.66MB |
| 04_Principles_of_Local_Search_II_10_min.mp4 |
14.49MB |
| 04_Principles_of_Local_Search_II_10_min.pdf |
110.94KB |
| 04_Principles_of_Local_Search_II_10_min.srt |
17.70KB |
| 04_Principles_of_Local_Search_II_10_min.txt |
11.93KB |
| 04_The_Basic_Algorithm_II_11_min_0_Slides_PDF.pdf |
2.30MB |
| 04_The_Basic_Algorithm_II_11_min.mp4 |
13.61MB |
| 04_The_Basic_Algorithm_II_11_min.pdf |
189.03KB |
| 04_The_Basic_Algorithm_II_11_min.srt |
16.05KB |
| 04_The_Basic_Algorithm_II_11_min.txt |
10.62KB |
| 04_The_Traveling_Salesman_Problem_15_min_0_Slides_PDF.pdf |
2.94MB |
| 04_The_Traveling_Salesman_Problem_15_min.mp4 |
21.00MB |
| 04_The_Traveling_Salesman_Problem_15_min.pdf |
148.45KB |
| 04_The_Traveling_Salesman_Problem_15_min.srt |
23.17KB |
| 04_The_Traveling_Salesman_Problem_15_min.txt |
15.34KB |
| 04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min_0_Slides_PDF.pdf |
1.16MB |
| 04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.mp4 |
9.62MB |
| 04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.pdf |
127.87KB |
| 04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.srt |
10.99KB |
| 04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.txt |
7.38KB |
| 05_A_Dynamic_Programming_Algorithm_for_TSP_12_min_0_Slides_PDF.pdf |
2.09MB |
| 05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.mp4 |
17.45MB |
| 05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.pdf |
180.90KB |
| 05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.srt |
18.00KB |
| 05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.txt |
12.06KB |
| 05_A_Dynamic_Programming_Algorithm_II_9_min_0_Slides_PDF.pdf |
2.84MB |
| 05_A_Dynamic_Programming_Algorithm_II_9_min.mp4 |
11.94MB |
| 05_A_Dynamic_Programming_Algorithm_II_9_min.pdf |
227.07KB |
| 05_A_Dynamic_Programming_Algorithm_II_9_min.srt |
15.42KB |
| 05_A_Dynamic_Programming_Algorithm_II_9_min.txt |
10.40KB |
| 05_Correctness_Proof_I_10_min_0_Slides_PDF.pdf |
3.48MB |
| 05_Correctness_Proof_I_10_min.mp4 |
13.30MB |
| 05_Correctness_Proof_I_10_min.pdf |
173.31KB |
| 05_Correctness_Proof_I_10_min.srt |
15.76KB |
| 05_Correctness_Proof_I_10_min.txt |
10.50KB |
| 05_Detecting_Negative_Cycles_9_min_0_Slides_PDF.pdf |
1.20MB |
| 05_Detecting_Negative_Cycles_9_min.mp4 |
12.78MB |
| 05_Detecting_Negative_Cycles_9_min.pdf |
130.17KB |
| 05_Detecting_Negative_Cycles_9_min.srt |
14.35KB |
| 05_Detecting_Negative_Cycles_9_min.txt |
9.60KB |
| 05_Graph_Representations_Part_I_Review_-_Optional_14_min_0_Slides_PDF.pdf |
1.79MB |
| 05_Graph_Representations_Part_I_Review_-_Optional_14_min.mp4 |
14.48MB |
| 05_Graph_Representations_Part_I_Review_-_Optional_14_min.pdf |
461.31KB |
| 05_Graph_Representations_Part_I_Review_-_Optional_14_min.srt |
23.68KB |
| 05_Graph_Representations_Part_I_Review_-_Optional_14_min.txt |
15.62KB |
| 05_Handling_Ties_Advanced_-_Optional_7_min_0_Slides_PDF.pdf |
1.34MB |
| 05_Handling_Ties_Advanced_-_Optional_7_min.mp4 |
9.65MB |
| 05_Handling_Ties_Advanced_-_Optional_7_min.pdf |
120.81KB |
| 05_Handling_Ties_Advanced_-_Optional_7_min.srt |
11.68KB |
| 05_Handling_Ties_Advanced_-_Optional_7_min.txt |
7.93KB |
| 05_Johnsons_Algorithm_I_11_min_0_Slides_PDF.pdf |
3.04MB |
| 05_Johnsons_Algorithm_I_11_min.mp4 |
15.49MB |
| 05_Johnsons_Algorithm_I_11_min.pdf |
167.30KB |
| 05_Johnsons_Algorithm_I_11_min.srt |
15.67KB |
| 05_Johnsons_Algorithm_I_11_min.txt |
10.51KB |
| 05_Knapsack_via_Dynamic_Programming_Revisited_10_min_0_Slides_PDF.pdf |
1.44MB |
| 05_Knapsack_via_Dynamic_Programming_Revisited_10_min.mp4 |
13.22MB |
| 05_Knapsack_via_Dynamic_Programming_Revisited_10_min.pdf |
144.40KB |
| 05_Knapsack_via_Dynamic_Programming_Revisited_10_min.srt |
15.50KB |
| 05_Knapsack_via_Dynamic_Programming_Revisited_10_min.txt |
10.38KB |
| 05 MSTs- State-of-the-Art and Open Questions Advanced - Optional 9 min 0 Slides PDF pdf |
1.20MB |
| 05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.mp4 |
14.23MB |
| 05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.pdf |
103.83KB |
| 05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.srt |
14.94KB |
| 05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.txt |
9.92KB |
| 05 Path Compression- The Hopcroft-Ullman Analysis I Advanced - Optional 9 min 0 Slides PDF pdf |
3.01MB |
| 05 Path Compression- The Hopcroft-Ullman Analysis I Advanced - Optional 9 min mp4 |
13.66MB |
| 05 Path Compression- The Hopcroft-Ullman Analysis I Advanced - Optional 9 min pdf |
154.56KB |
| 05 Path Compression- The Hopcroft-Ullman Analysis I Advanced - Optional 9 min srt |
14.13KB |
| 05 Path Compression- The Hopcroft-Ullman Analysis I Advanced - Optional 9 min txt |
9.38KB |
| 05_Principles_of_Dynamic_Programming_8_min_0_Slides_PDF.pdf |
862.10KB |
| 05_Principles_of_Dynamic_Programming_8_min.mp4 |
12.27MB |
| 05_Principles_of_Dynamic_Programming_8_min.pdf |
107.16KB |
| 05_Principles_of_Dynamic_Programming_8_min.srt |
12.35KB |
| 05_Principles_of_Dynamic_Programming_8_min.txt |
8.26KB |
| 05_Proof_of_Cut_Property_Advanced_-_Optional_12_min_0_Slides_PDF.pdf |
2.15MB |
| 05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.mp4 |
14.99MB |
| 05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.pdf |
160.08KB |
| 05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.srt |
19.44KB |
| 05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.txt |
12.78KB |
| 05_The_2-SAT_Problem_15_min_0_Slides_PDF.pdf |
1.72MB |
| 05_The_2-SAT_Problem_15_min.mp4 |
19.64MB |
| 05_The_2-SAT_Problem_15_min.pdf |
121.19KB |
| 05_The_2-SAT_Problem_15_min.srt |
22.38KB |
| 05_The_2-SAT_Problem_15_min.txt |
15.00KB |
| 05_The_P_vs._NP_Question_9_min_0_Slides_PDF.pdf |
1.27MB |
| 05_The_P_vs._NP_Question_9_min.mp4 |
14.28MB |
| 05_The_P_vs._NP_Question_9_min.pdf |
92.67KB |
| 05_The_P_vs._NP_Question_9_min.srt |
13.20KB |
| 05_The_P_vs._NP_Question_9_min.txt |
8.87KB |
| 06_A_Space_Optimization_12_min_0_Slides_PDF.pdf |
2.18MB |
| 06_A_Space_Optimization_12_min.mp4 |
18.34MB |
| 06_A_Space_Optimization_12_min.pdf |
130.28KB |
| 06_A_Space_Optimization_12_min.srt |
18.61KB |
| 06_A_Space_Optimization_12_min.txt |
12.50KB |
| 06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min_0_Slides_PDF.pdf |
1.10MB |
| 06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.mp4 |
19.86MB |
| 06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.pdf |
102.73KB |
| 06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.srt |
20.39KB |
| 06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.txt |
13.76KB |
| 06_Ananysis_of_Dynamic_Programming_Heuristic_15_min_0_Slides_PDF.pdf |
2.06MB |
| 06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.mp4 |
18.70MB |
| 06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.pdf |
138.24KB |
| 06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.srt |
21.33KB |
| 06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.txt |
14.33KB |
| 06_Correctness_Proof_II_13_min_0_Slides_PDF.pdf |
3.48MB |
| 06_Correctness_Proof_II_13_min.mp4 |
16.75MB |
| 06_Correctness_Proof_II_13_min.pdf |
173.31KB |
| 06_Correctness_Proof_II_13_min.srt |
20.89KB |
| 06_Correctness_Proof_II_13_min.txt |
13.85KB |
| 06_Fast_Implementation_I_15_min_0_Slides_PDF.pdf |
3.30MB |
| 06_Fast_Implementation_I_15_min.mp4 |
19.66MB |
| 06_Fast_Implementation_I_15_min.pdf |
139.05KB |
| 06_Fast_Implementation_I_15_min.srt |
23.47KB |
| 06_Fast_Implementation_I_15_min.txt |
15.68KB |
| 06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min_0_Slides_PDF.pdf |
2.29MB |
| 06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.mp4 |
24.36MB |
| 06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.pdf |
1.99MB |
| 06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.srt |
40.16KB |
| 06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.txt |
26.67KB |
| 06_Johnsons_Algorithm_II_11_min_0_Slides_PDF.pdf |
3.04MB |
| 06_Johnsons_Algorithm_II_11_min.mp4 |
16.86MB |
| 06_Johnsons_Algorithm_II_11_min.pdf |
167.30KB |
| 06_Johnsons_Algorithm_II_11_min.srt |
16.87KB |
| 06_Johnsons_Algorithm_II_11_min.txt |
11.24KB |
| 06 Path Compression- The Hopcroft-Ullman Analysis II Advanced - Optional 12 min 0 Slides PDF pdf |
3.01MB |
| 06 Path Compression- The Hopcroft-Ullman Analysis II Advanced - Optional 12 min mp4 |
17.17MB |
| 06 Path Compression- The Hopcroft-Ullman Analysis II Advanced - Optional 12 min pdf |
154.56KB |
| 06 Path Compression- The Hopcroft-Ullman Analysis II Advanced - Optional 12 min srt |
17.28KB |
| 06 Path Compression- The Hopcroft-Ullman Analysis II Advanced - Optional 12 min txt |
11.47KB |
| 06_Random_Walks_on_a_Line_16_min_0_Slides_PDF.pdf |
2.27MB |
| 06_Random_Walks_on_a_Line_16_min.mp4 |
21.33MB |
| 06_Random_Walks_on_a_Line_16_min.pdf |
202.14KB |
| 06_Random_Walks_on_a_Line_16_min.srt |
24.24KB |
| 06_Random_Walks_on_a_Line_16_min.txt |
16.21KB |
| 07_Analysis_of_Papadimitrious_Algorithm_15_min_0_Slides_PDF.pdf |
2.47MB |
| 07_Analysis_of_Papadimitrious_Algorithm_15_min.mp4 |
21.62MB |
| 07_Analysis_of_Papadimitrious_Algorithm_15_min.pdf |
142.14KB |
| 07_Analysis_of_Papadimitrious_Algorithm_15_min.srt |
21.49KB |
| 07_Analysis_of_Papadimitrious_Algorithm_15_min.txt |
14.39KB |
| 07 Dijkstras Shortest-Path Algorithm Part I Review - Optional 21 min 0 Slides PDF pdf |
2.69MB |
| 07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.mp4 |
21.92MB |
| 07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.pdf |
432.73KB |
| 07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.srt |
33.72KB |
| 07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.txt |
22.41KB |
| 07_Fast_Implementation_II_10_min_0_Slides_PDF.pdf |
3.30MB |
| 07_Fast_Implementation_II_10_min.mp4 |
13.17MB |
| 07_Fast_Implementation_II_10_min.pdf |
139.05KB |
| 07_Fast_Implementation_II_10_min.srt |
15.29KB |
| 07_Fast_Implementation_II_10_min.txt |
10.20KB |
| 07_Internet_Routing_I_Optional_11_min_0_Slides_PDF.pdf |
1.69MB |
| 07_Internet_Routing_I_Optional_11_min.mp4 |
16.72MB |
| 07_Internet_Routing_I_Optional_11_min.pdf |
125.22KB |
| 07_Internet_Routing_I_Optional_11_min.srt |
18.93KB |
| 07_Internet_Routing_I_Optional_11_min.txt |
12.65KB |
| 07_The_Ackermann_Function_Advanced_-_Optional_17_min_0_Slides_PDF.pdf |
2.46MB |
| 07_The_Ackermann_Function_Advanced_-_Optional_17_min.mp4 |
22.64MB |
| 07_The_Ackermann_Function_Advanced_-_Optional_17_min.pdf |
160.27KB |
| 07_The_Ackermann_Function_Advanced_-_Optional_17_min.srt |
21.75KB |
| 07_The_Ackermann_Function_Advanced_-_Optional_17_min.txt |
14.41KB |
| 08 Data Structures- Overview Part I Review - Optional 5 min 0 Slides PDF pdf |
844.40KB |
| 08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.mp4 |
4.89MB |
| 08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.pdf |
192.87KB |
| 08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.srt |
7.55KB |
| 08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.txt |
5.07KB |
| 08_Internet_Routing_II_Optional_7_min_0_Slides_PDF.pdf |
1.69MB |
| 08_Internet_Routing_II_Optional_7_min.mp4 |
10.68MB |
| 08_Internet_Routing_II_Optional_7_min.pdf |
125.22KB |
| 08_Internet_Routing_II_Optional_7_min.srt |
11.08KB |
| 08_Internet_Routing_II_Optional_7_min.txt |
7.46KB |
| 08 Path Compression- Tarjans Analysis I Advanced - Optional 14 min 0 Slides PDF pdf |
3.43MB |
| 08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.mp4 |
20.78MB |
| 08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.pdf |
181.20KB |
| 08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.srt |
21.16KB |
| 08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.txt |
14.23KB |
| 09 Heaps- Operations and Applications Part I Review - Optional 18 min 0 Slides PDF pdf |
2.11MB |
| 09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.mp4 |
19.49MB |
| 09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.pdf |
220.89KB |
| 09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.srt |
29.94KB |
| 09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.txt |
19.96KB |
| 09 Path Compression- Tarjans Analysis II Advanced - Optional 14 min 0 Slides PDF pdf |
3.43MB |
| 09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.mp4 |
19.09MB |
| 09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.pdf |
181.20KB |
| 09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.srt |
19.71KB |
| 09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.txt |
13.22KB |
| 1_Programming_Assignment_1.html |
42.84KB |
| 10_Problem_Set_6.html |
101.47KB |
| 11_Programming_Assignment_6.html |
47.93KB |
| 2_Problem_Set_2.html |
93.24KB |
| 2sat1.txt |
1.22MB |
| 2sat2.txt |
2.65MB |
| 2sat3.txt |
5.51MB |
| 2sat4.txt |
8.37MB |
| 2sat5.txt |
11.23MB |
| 2sat6.txt |
14.09MB |
| 3_Programming_Assignment_2.html |
54.82KB |
| 4_Problem_Set_3.html |
112.46KB |
| 5_Programming_Assignment_3.html |
41.37KB |
| 6_Problem_Set_4.html |
103.60KB |
| 7_Programming_Assignment_4.html |
50.62KB |
| 8_Problem_Set_5.html |
78.07KB |
| 9_Programming_Assignment_5.html |
52.59KB |
| assignment_home.html |
30.72KB |
| Assignments.html |
98.11KB |
| clustering_big.txt |
9.35MB |
| clustering1.txt |
1.48MB |
| course_home.html |
62.07KB |
| CourseLogisticsAssessment.html |
35.31KB |
| DiscussionForums.html |
59.19KB |
| edges.txt |
27.63KB |
| entered_login.html |
1.31MB |
| Final Exam.html |
34.31KB |
| g1.txt |
497.57KB |
| g2.txt |
497.73KB |
| g3.txt |
497.55KB |
| Home.html |
62.02KB |
| jobs.txt |
57.03KB |
| knapsack_big.txt |
24.97KB |
| knapsack1.txt |
987B |
| large.txt |
13.15MB |
| links.txt |
1.35KB |
| links.txt |
1.35KB |
| links.txt |
1.72KB |
| links.txt |
1.47KB |
| links.txt |
1.35KB |
| links.txt |
1.49KB |
| links.txt |
1.35KB |
| links.txt |
1.48KB |
| links.txt |
1.35KB |
| links.txt |
1.59KB |
| links.txt |
1.35KB |
| links.txt |
1.46KB |
| links.txt |
1.33KB |
| links.txt |
1.23KB |
| links.txt |
1.41KB |
| links.txt |
2.34KB |
| links.txt |
1.33KB |
| links.txt |
1.42KB |
| links.txt |
1.33KB |
| Syllabus.html |
38.45KB |
| TheoryOptionalProblems.html |
87.35KB |
| Tips.html |
35.97KB |
| tsp.txt |
552B |
| zip_page.html |
47.93KB |
| zip_page.html |
42.84KB |
| zip_page.html |
54.82KB |
| zip_page.html |
41.37KB |
| zip_page.html |
50.62KB |
| zip_page.html |
52.59KB |