Internet Archive's in-browser video player requires JavaScript to be enabled. It appears your browser does not have it turned on. Please see your browser settings for this feature.

[Coursera] Algorithms: Design and Analysis, Part 2 (Stanford University) (algo2)

by: Stanford University

Publisher: Academic Torrents

Contributor: Academic Torrents

Academictorrents_collection: video-lectures

Addeddate: 2018-08-12 18:02:56

External-identifier: urn:academictorrents:e24c15ce89cac9c380284595d1d8a475cb485e28

Identifier: academictorrents_e24c15ce89cac9c380284595d1d8a475cb485e28

Ocr: ABBYY FineReader 11.0 (Extended OCR)

Ppi: 600

Scanner: Internet Archive Python library 1.8.1

Source: http://academictorrents.com/details/e24c15ce89cac9c380284595d1d8a475cb485e28
torrent:urn:sha1:e24c15ce89cac9c380284595d1d8a475cb485e28

plus-circle Add Review

comment
Reviews

There are no reviews yet. Be the first one to write a review.

10,425 Views

4 Favorites

DOWNLOAD OPTIONS

206 files

ABBYY GZ

BACK

22.5K

01_Application-_Internet_Routing_11_min_0_Slides_PDF_abbyy.gz

16.1K

01_Application-_Internet_Routing_11_min_abbyy.gz

34.6K

02_Application-_Sequence_Alignment_9_min_0_Slides_PDF_abbyy.gz

27.3K

02_Application-_Sequence_Alignment_9_min_abbyy.gz

80.3K

01_About_the_Course_Part_I_Review_-_Optional_17_min_0_Slides_PDF_abbyy.gz

84.4K

01_About_the_Course_Part_I_Review_-_Optional_17_min_abbyy.gz

52.4K

02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min_0_Slides_PDF_abbyy.gz

49.1K

02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min_abbyy.gz

31.5K

03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min_0_Slides_PDF_abbyy.gz

25.0K

03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min_abbyy.gz

13.7K

04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min_0_Slides_PDF_abbyy.gz

13.2K

04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min_abbyy.gz

42.0K

05_Graph_Representations_Part_I_Review_-_Optional_14_min_0_Slides_PDF_abbyy.gz

39.8K

05_Graph_Representations_Part_I_Review_-_Optional_14_min_abbyy.gz

34.2K

06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min_0_Slides_PDF_abbyy.gz

33.1K

06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min_abbyy.gz

37.1K

07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min_0_Slides_PDF_abbyy.gz

37.1K

07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min_abbyy.gz

14.0K

08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min_0_Slides_PDF_abbyy.gz

12.5K

08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min_abbyy.gz

35.6K

09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min_0_Slides_PDF_abbyy.gz

36.2K

09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min_abbyy.gz

32.0K

01_Introduction_to_Greedy_Algorithms_13_min_0_Slides_PDF_abbyy.gz

21.1K

01_Introduction_to_Greedy_Algorithms_13_min_abbyy.gz

19.0K

02_Application-_Optimal_Caching_11_min_0_Slides_PDF_abbyy.gz

15.7K

02_Application-_Optimal_Caching_11_min_abbyy.gz

18.2K

01_Problem_Definition_6_min_0_Slides_PDF_abbyy.gz

14.0K

01_Problem_Definition_6_min_abbyy.gz

26.2K

02_A_Greedy_Algorithm_13_min_0_Slides_PDF_abbyy.gz

20.6K

02_A_Greedy_Algorithm_13_min_abbyy.gz

22.0K

03_Correctness_Proof_-_Part_I_7_min_0_Slides_PDF_abbyy.gz

19.3K

03_Correctness_Proof_-_Part_I_7_min_abbyy.gz

16.8K

04_Correctness_Proof_-_Part_II_5_min_0_Slides_PDF_abbyy.gz

14.2K

04_Correctness_Proof_-_Part_II_5_min_abbyy.gz

23.2K

05_Handling_Ties_Advanced_-_Optional_7_min_0_Slides_PDF_abbyy.gz

20.4K

05_Handling_Ties_Advanced_-_Optional_7_min_abbyy.gz

21.2K

01_MST_Problem_Definition_11_min_0_Slides_PDF_abbyy.gz

18.9K

01_MST_Problem_Definition_11_min_abbyy.gz

16.6K

02_Prims_MST_Algorithm_8_min_0_Slides_PDF_abbyy.gz

14.9K

02_Prims_MST_Algorithm_8_min_abbyy.gz

33.2K

03_Correctness_Proof_I_16_min_0_Slides_PDF_abbyy.gz

28.4K

03_Correctness_Proof_I_16_min_abbyy.gz

17.4K

04_Correctness_Proof_II_8_min_0_Slides_PDF_abbyy.gz

15.2K

04_Correctness_Proof_II_8_min_abbyy.gz

32.8K

05_Proof_of_Cut_Property_Advanced_-_Optional_12_min_0_Slides_PDF_abbyy.gz

25.9K

05_Proof_of_Cut_Property_Advanced_-_Optional_12_min_abbyy.gz

47.5K

06_Fast_Implementation_I_15_min_0_Slides_PDF_abbyy.gz

33.2K

06_Fast_Implementation_I_15_min_abbyy.gz

47.5K

07_Fast_Implementation_II_10_min_0_Slides_PDF_abbyy.gz

33.2K

07_Fast_Implementation_II_10_min_abbyy.gz

13.2K

01_Kruskals_MST_Algorithm_8_min_0_Slides_PDF_abbyy.gz

10.9K

01_Kruskals_MST_Algorithm_8_min_abbyy.gz

21.0K

02_Correctness_of_Kruskals_Algorithm_9_min_0_Slides_PDF_abbyy.gz

18.2K

02_Correctness_of_Kruskals_Algorithm_9_min_abbyy.gz

53.1K

03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min_0_Slides_PDF_abbyy.gz

44.1K

03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min_abbyy.gz

53.1K

04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min_0_Slides_PDF_abbyy.gz

44.1K

04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min_abbyy.gz

18.5K

05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min_0_Slides_PDF_abbyy.gz

15.7K

05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min_abbyy.gz

25.6K

01_Application_to_Clustering_12_min_0_Slides_PDF_abbyy.gz

21.6K

01_Application_to_Clustering_12_min_abbyy.gz

25.5K

02_Correctness_of_Clustering_Algorithm_10_min_0_Slides_PDF_abbyy.gz

21.0K

02_Correctness_of_Clustering_Algorithm_10_min_abbyy.gz

24.9K

01_Lazy_Unions_Advanced_-_Optional_10_min_0_Slides_PDF_abbyy.gz

18.1K

01_Lazy_Unions_Advanced_-_Optional_10_min_abbyy.gz

36.4K

02_Union-by-Rank_Advanced_-_Optional_12_min_0_Slides_PDF_abbyy.gz

30.5K

02_Union-by-Rank_Advanced_-_Optional_12_min_abbyy.gz

39.3K

03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min_0_Slides_PDF_abbyy.gz

30.6K

03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min_abbyy.gz

26.8K

04_Path_Compression_Advanced_-_Optional_15_min_0_Slides_PDF_abbyy.gz

27.2K

04_Path_Compression_Advanced_-_Optional_15_min_abbyy.gz

44.1K

05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min_0_Slides_PDF_abbyy.gz

35.0K

05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min_abbyy.gz

44.1K

06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min_0_Slides_PDF_abbyy.gz

35.0K

06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min_abbyy.gz

32.6K

07_The_Ackermann_Function_Advanced_-_Optional_17_min_0_Slides_PDF_abbyy.gz

33.0K

07_The_Ackermann_Function_Advanced_-_Optional_17_min_abbyy.gz

55.6K

08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min_0_Slides_PDF_abbyy.gz

48.2K

08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min_abbyy.gz

55.6K

09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min_0_Slides_PDF_abbyy.gz

48.2K

09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min_abbyy.gz

31.6K

01_Introduction_and_Motivation_9_min_0_Slides_PDF_abbyy.gz

22.7K

01_Introduction_and_Motivation_9_min_abbyy.gz

24.8K

02_Problem_Definition_10_min_0_Slides_PDF_abbyy.gz

19.1K

02_Problem_Definition_10_min_abbyy.gz

34.4K

03_A_Greedy_Algorithm_17_min_0_Slides_PDF_abbyy.gz

31.5K

03_A_Greedy_Algorithm_17_min_abbyy.gz

15.2K

04_A_More_Complex_Example_4_min_0_Slides_PDF_abbyy.gz

9.8K

04_A_More_Complex_Example_4_min_abbyy.gz

45.4K

05_Correctness_Proof_I_10_min_0_Slides_PDF_abbyy.gz

38.4K

05_Correctness_Proof_I_10_min_abbyy.gz

45.4K

06_Correctness_Proof_II_13_min_0_Slides_PDF_abbyy.gz

38.4K

06_Correctness_Proof_II_13_min_abbyy.gz

23.3K

01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min_0_Slides_PDF_abbyy.gz

16.1K

01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min_abbyy.gz

27.2K

02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min_0_Slides_PDF_abbyy.gz

21.1K

02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min_abbyy.gz

22.7K

03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min_0_Slides_PDF_abbyy.gz

22.0K

03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min_abbyy.gz

17.7K

04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min_0_Slides_PDF_abbyy.gz

17.3K

04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min_abbyy.gz

33.1K

05_Principles_of_Dynamic_Programming_8_min_0_Slides_PDF_abbyy.gz

11.9K

05_Principles_of_Dynamic_Programming_8_min_abbyy.gz

23.8K

01_The_Knapsack_Problem_10_min_0_Slides_PDF_abbyy.gz

21.2K

01_The_Knapsack_Problem_10_min_abbyy.gz

21.2K

02_A_Dynamic_Programming_Algorithm_10_min_0_Slides_PDF_abbyy.gz

21.0K

02_A_Dynamic_Programming_Algorithm_10_min_abbyy.gz

10.8K

03_Example_Review_-_Optional_14_min_0_Slides_PDF_abbyy.gz

5.8K

03_Example_Review_-_Optional_14_min_abbyy.gz

34.3K

01_Optimal_Substructure_14_min_0_Slides_PDF_abbyy.gz

30.8K

01_Optimal_Substructure_14_min_abbyy.gz

36.3K

02_A_Dynamic_Programming_Algorithm_12_min_0_Slides_PDF_abbyy.gz

30.2K

02_A_Dynamic_Programming_Algorithm_12_min_abbyy.gz

32.3K

01_Problem_Definition_12_min_0_Slides_PDF_abbyy.gz

24.9K

01_Problem_Definition_12_min_abbyy.gz

33.5K

02_Optimal_Substructure_9_min_0_Slides_PDF_abbyy.gz

38.7K

02_Optimal_Substructure_9_min_abbyy.gz

33.5K

03_Proof_of_Optimal_Substructure_7_min_0_Slides_PDF_abbyy.gz

38.6K

03_Proof_of_Optimal_Substructure_7_min_abbyy.gz

35.9K

04_A_Dynamic_Programming_Algorithm_I_10_min_0_Slides_PDF_abbyy.gz

33.9K

04_A_Dynamic_Programming_Algorithm_I_10_min_abbyy.gz

35.9K

05_A_Dynamic_Programming_Algorithm_II_9_min_0_Slides_PDF_abbyy.gz

33.9K

05_A_Dynamic_Programming_Algorithm_II_9_min_abbyy.gz

31.0K

01_Single-Source_Shortest_Paths_Revisted_11_min_0_Slides_PDF_abbyy.gz

24.6K

01_Single-Source_Shortest_Paths_Revisted_11_min_abbyy.gz

37.6K

02_Optimal_Substructure_11_min_0_Slides_PDF_abbyy.gz

28.1K

02_Optimal_Substructure_11_min_abbyy.gz

39.1K

03_The_Basic_Algorithm_I_9_min_0_Slides_PDF_abbyy.gz

32.2K

03_The_Basic_Algorithm_I_9_min_abbyy.gz

39.1K

04_The_Basic_Algorithm_II_11_min_0_Slides_PDF_abbyy.gz

32.2K

04_The_Basic_Algorithm_II_11_min_abbyy.gz

22.2K

05_Detecting_Negative_Cycles_9_min_0_Slides_PDF_abbyy.gz

16.3K

05_Detecting_Negative_Cycles_9_min_abbyy.gz

32.0K

06_A_Space_Optimization_12_min_0_Slides_PDF_abbyy.gz

30.3K

06_A_Space_Optimization_12_min_abbyy.gz

27.7K

07_Internet_Routing_I_Optional_11_min_0_Slides_PDF_abbyy.gz

21.4K

07_Internet_Routing_I_Optional_11_min_abbyy.gz

27.7K

08_Internet_Routing_II_Optional_7_min_0_Slides_PDF_abbyy.gz

21.4K

08_Internet_Routing_II_Optional_7_min_abbyy.gz

15.4K

01_Problem_Definition_7_min_0_Slides_PDF_abbyy.gz

14.0K

01_Problem_Definition_7_min_abbyy.gz

31.4K

02_Optimal_Substructure_12_min_0_Slides_PDF_abbyy.gz

23.5K

02_Optimal_Substructure_12_min_abbyy.gz

26.0K

03_The_Floyd-Warshall_Algorithm_13_min_0_Slides_PDF_abbyy.gz

22.2K

03_The_Floyd-Warshall_Algorithm_13_min_abbyy.gz

34.4K

04_A_Reweighting_Technique_14_min_0_Slides_PDF_abbyy.gz

29.8K

04_A_Reweighting_Technique_14_min_abbyy.gz

42.3K

05_Johnsons_Algorithm_I_11_min_0_Slides_PDF_abbyy.gz

37.9K

05_Johnsons_Algorithm_I_11_min_abbyy.gz

42.4K

06_Johnsons_Algorithm_II_11_min_0_Slides_PDF_abbyy.gz

37.9K

06_Johnsons_Algorithm_II_11_min_abbyy.gz

32.3K

01_Polynomial-Time_Solvable_Problems_14_min_0_Slides_PDF_abbyy.gz

24.8K

01_Polynomial-Time_Solvable_Problems_14_min_abbyy.gz

29.3K

02_Reductions_and_Completeness_14_min_0_Slides_PDF_abbyy.gz

23.0K

02_Reductions_and_Completeness_14_min_abbyy.gz

34.0K

03_Definition_and_Interpretation_of_NP-Completeness_I_11_min_0_Slides_PDF_abbyy.gz

25.5K

03_Definition_and_Interpretation_of_NP-Completeness_I_11_min_abbyy.gz

34.0K

04_Definition_and_Interpretation_of_NP-Completeness_II_8_min_0_Slides_PDF_abbyy.gz

25.5K

04_Definition_and_Interpretation_of_NP-Completeness_II_8_min_abbyy.gz

16.5K

05_The_P_vs._NP_Question_9_min_0_Slides_PDF_abbyy.gz

15.1K

05_The_P_vs._NP_Question_9_min_abbyy.gz

17.5K

06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min_0_Slides_PDF_abbyy.gz

16.4K

06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min_abbyy.gz

22.2K

01_The_Vertex_Cover_Problem_9_min_0_Slides_PDF_abbyy.gz

16.0K

01_The_Vertex_Cover_Problem_9_min_abbyy.gz

38.7K

02_Smarter_Search_for_Vertex_Cover_I_10_min_0_Slides_PDF_abbyy.gz

33.7K

02_Smarter_Search_for_Vertex_Cover_I_10_min_abbyy.gz

38.6K

03_Smarter_Search_for_Vertex_Cover_II_8_min_0_Slides_PDF_abbyy.gz

33.7K

03_Smarter_Search_for_Vertex_Cover_II_8_min_abbyy.gz

45.6K

04_The_Traveling_Salesman_Problem_15_min_0_Slides_PDF_abbyy.gz

39.4K

04_The_Traveling_Salesman_Problem_15_min_abbyy.gz

30.9K

05_A_Dynamic_Programming_Algorithm_for_TSP_12_min_0_Slides_PDF_abbyy.gz

27.3K

05_A_Dynamic_Programming_Algorithm_for_TSP_12_min_abbyy.gz

40.6K

01_A_Greedy_Knapsack_Heuristic_14_min_0_Slides_PDF_abbyy.gz

28.4K

01_A_Greedy_Knapsack_Heuristic_14_min_abbyy.gz

45.9K

02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min_0_Slides_PDF_abbyy.gz

37.7K

02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min_abbyy.gz

45.9K

03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min_0_Slides_PDF_abbyy.gz

37.8K

03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min_abbyy.gz

24.7K

04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min_0_Slides_PDF_abbyy.gz

23.1K

04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min_abbyy.gz

27.2K

05_Knapsack_via_Dynamic_Programming_Revisited_10_min_0_Slides_PDF_abbyy.gz

20.9K

05_Knapsack_via_Dynamic_Programming_Revisited_10_min_abbyy.gz

37.1K

06_Ananysis_of_Dynamic_Programming_Heuristic_15_min_0_Slides_PDF_abbyy.gz

27.9K

06_Ananysis_of_Dynamic_Programming_Heuristic_15_min_abbyy.gz

46.5K

01_The_Maximum_Cut_Problem_I_9_min_0_Slides_PDF_abbyy.gz

37.6K

01_The_Maximum_Cut_Problem_I_9_min_abbyy.gz

46.5K

02_The_Maximum_Cut_Problem_II_9_min_0_Slides_PDF_abbyy.gz

37.6K

02_The_Maximum_Cut_Problem_II_9_min_abbyy.gz

32.7K

03_Principles_of_Local_Search_I_9_min_0_Slides_PDF_abbyy.gz

29.4K

03_Principles_of_Local_Search_I_9_min_abbyy.gz

32.7K

04_Principles_of_Local_Search_II_10_min_0_Slides_PDF_abbyy.gz

29.4K

04_Principles_of_Local_Search_II_10_min_abbyy.gz

25.8K

05_The_2-SAT_Problem_15_min_0_Slides_PDF_abbyy.gz

21.9K

05_The_2-SAT_Problem_15_min_abbyy.gz

20.8K

06_Random_Walks_on_a_Line_16_min_0_Slides_PDF_abbyy.gz

25.9K

06_Random_Walks_on_a_Line_16_min_abbyy.gz

35.6K

07_Analysis_of_Papadimitrious_Algorithm_15_min_0_Slides_PDF_abbyy.gz

33.5K

07_Analysis_of_Papadimitrious_Algorithm_15_min_abbyy.gz

72.1K

01_Stable_Matching_Optional_15_min_0_Slides_PDF_abbyy.gz

51.0K

01_Stable_Matching_Optional_15_min_abbyy.gz

72.1K

02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min_0_Slides_PDF_abbyy.gz

51.1K

02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min_abbyy.gz

72.1K

03_Linear_Programming_and_Beyond_Optional_11_min_0_Slides_PDF_abbyy.gz

51.0K

03_Linear_Programming_and_Beyond_Optional_11_min_abbyy.gz

206 files

FULL TEXT

BACK

845.0B

01_Application-_Internet_Routing_11_min_0_Slides_PDF_djvu.txt

1.0K

01_Application-_Internet_Routing_11_min_djvu.txt

1.4K

02_Application-_Sequence_Alignment_9_min_0_Slides_PDF_djvu.txt

1.8K

02_Application-_Sequence_Alignment_9_min_djvu.txt

6.2K

01_About_the_Course_Part_I_Review_-_Optional_17_min_0_Slides_PDF_djvu.txt

6.2K

01_About_the_Course_Part_I_Review_-_Optional_17_min_djvu.txt

3.0K

02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min_0_Slides_PDF_djvu.txt

3.1K

02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min_djvu.txt

1.3K

03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min_0_Slides_PDF_djvu.txt

1.4K

03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min_djvu.txt

526.0B

04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min_0_Slides_PDF_djvu.txt

654.0B

04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min_djvu.txt

1.9K

05_Graph_Representations_Part_I_Review_-_Optional_14_min_0_Slides_PDF_djvu.txt

2.1K

05_Graph_Representations_Part_I_Review_-_Optional_14_min_djvu.txt

1.5K

06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min_0_Slides_PDF_djvu.txt

1.9K

06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min_djvu.txt

1.5K

07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min_0_Slides_PDF_djvu.txt

2.0K

07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min_djvu.txt

563.0B

08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min_0_Slides_PDF_djvu.txt

710.0B

08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min_djvu.txt

1.5K

09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min_0_Slides_PDF_djvu.txt

2.0K

09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min_djvu.txt

1.3K

01_Introduction_to_Greedy_Algorithms_13_min_0_Slides_PDF_djvu.txt

1.4K

01_Introduction_to_Greedy_Algorithms_13_min_djvu.txt

769.0B

02_Application-_Optimal_Caching_11_min_0_Slides_PDF_djvu.txt

983.0B

02_Application-_Optimal_Caching_11_min_djvu.txt

762.0B

01_Problem_Definition_6_min_0_Slides_PDF_djvu.txt

807.0B

01_Problem_Definition_6_min_djvu.txt

1.0K

02_A_Greedy_Algorithm_13_min_0_Slides_PDF_djvu.txt

1.3K

02_A_Greedy_Algorithm_13_min_djvu.txt

952.0B

03_Correctness_Proof_-_Part_I_7_min_0_Slides_PDF_djvu.txt

1.2K

03_Correctness_Proof_-_Part_I_7_min_djvu.txt

601.0B

04_Correctness_Proof_-_Part_II_5_min_0_Slides_PDF_djvu.txt

828.0B

04_Correctness_Proof_-_Part_II_5_min_djvu.txt

977.0B

05_Handling_Ties_Advanced_-_Optional_7_min_0_Slides_PDF_djvu.txt

1.2K

05_Handling_Ties_Advanced_-_Optional_7_min_djvu.txt

878.0B

01_MST_Problem_Definition_11_min_0_Slides_PDF_djvu.txt

1.2K

01_MST_Problem_Definition_11_min_djvu.txt

638.0B

02_Prims_MST_Algorithm_8_min_0_Slides_PDF_djvu.txt

919.0B

02_Prims_MST_Algorithm_8_min_djvu.txt

1.4K

03_Correctness_Proof_I_16_min_0_Slides_PDF_djvu.txt

1.8K

03_Correctness_Proof_I_16_min_djvu.txt

751.0B

04_Correctness_Proof_II_8_min_0_Slides_PDF_djvu.txt

921.0B

04_Correctness_Proof_II_8_min_djvu.txt

1.3K

05_Proof_of_Cut_Property_Advanced_-_Optional_12_min_0_Slides_PDF_djvu.txt

1.6K

05_Proof_of_Cut_Property_Advanced_-_Optional_12_min_djvu.txt

1.9K

06_Fast_Implementation_I_15_min_0_Slides_PDF_djvu.txt

2.1K

06_Fast_Implementation_I_15_min_djvu.txt

1.9K

07_Fast_Implementation_II_10_min_0_Slides_PDF_djvu.txt

2.1K

07_Fast_Implementation_II_10_min_djvu.txt

558.0B

01_Kruskals_MST_Algorithm_8_min_0_Slides_PDF_djvu.txt

617.0B

01_Kruskals_MST_Algorithm_8_min_djvu.txt

890.0B

02_Correctness_of_Kruskals_Algorithm_9_min_0_Slides_PDF_djvu.txt

1.1K

02_Correctness_of_Kruskals_Algorithm_9_min_djvu.txt

2.3K

03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min_0_Slides_PDF_djvu.txt

2.9K

03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min_djvu.txt

2.3K

04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min_0_Slides_PDF_djvu.txt

2.9K

04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min_djvu.txt

711.0B

05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min_0_Slides_PDF_djvu.txt

960.0B

05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min_djvu.txt

1.1K

01_Application_to_Clustering_12_min_0_Slides_PDF_djvu.txt

1.3K

01_Application_to_Clustering_12_min_djvu.txt

1.0K

02_Correctness_of_Clustering_Algorithm_10_min_0_Slides_PDF_djvu.txt

1.3K

02_Correctness_of_Clustering_Algorithm_10_min_djvu.txt

976.0B

01_Lazy_Unions_Advanced_-_Optional_10_min_0_Slides_PDF_djvu.txt

1.1K

01_Lazy_Unions_Advanced_-_Optional_10_min_djvu.txt

1.5K

02_Union-by-Rank_Advanced_-_Optional_12_min_0_Slides_PDF_djvu.txt

1.8K

02_Union-by-Rank_Advanced_-_Optional_12_min_djvu.txt

1.6K

03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min_0_Slides_PDF_djvu.txt

2.0K

03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min_djvu.txt

1.2K

04_Path_Compression_Advanced_-_Optional_15_min_0_Slides_PDF_djvu.txt

1.5K

04_Path_Compression_Advanced_-_Optional_15_min_djvu.txt

1.9K

05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min_0_Slides_PDF_djvu.txt

2.2K

05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min_djvu.txt

1.9K

06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min_0_Slides_PDF_djvu.txt

2.2K

06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min_djvu.txt

1.2K

07_The_Ackermann_Function_Advanced_-_Optional_17_min_0_Slides_PDF_djvu.txt

2.0K

07_The_Ackermann_Function_Advanced_-_Optional_17_min_djvu.txt

2.5K

08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min_0_Slides_PDF_djvu.txt

3.1K

08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min_djvu.txt

2.5K

09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min_0_Slides_PDF_djvu.txt

3.1K

09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min_djvu.txt

1.3K

01_Introduction_and_Motivation_9_min_0_Slides_PDF_djvu.txt

1.4K

01_Introduction_and_Motivation_9_min_djvu.txt

1.1K

02_Problem_Definition_10_min_0_Slides_PDF_djvu.txt

1.1K

02_Problem_Definition_10_min_djvu.txt

1.3K

03_A_Greedy_Algorithm_17_min_0_Slides_PDF_djvu.txt

1.8K

03_A_Greedy_Algorithm_17_min_djvu.txt

612.0B

04_A_More_Complex_Example_4_min_0_Slides_PDF_djvu.txt

545.0B

04_A_More_Complex_Example_4_min_djvu.txt

1.8K

05_Correctness_Proof_I_10_min_0_Slides_PDF_djvu.txt

2.4K

05_Correctness_Proof_I_10_min_djvu.txt

1.8K

06_Correctness_Proof_II_13_min_0_Slides_PDF_djvu.txt

2.4K

06_Correctness_Proof_II_13_min_djvu.txt

991.0B

01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min_0_Slides_PDF_djvu.txt

984.0B

01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min_djvu.txt

1.2K

02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min_0_Slides_PDF_djvu.txt

1.3K

02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min_djvu.txt

927.0B

03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min_0_Slides_PDF_djvu.txt

1.4K

03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min_djvu.txt

725.0B

04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min_0_Slides_PDF_djvu.txt

1.0K

04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min_djvu.txt

2.0K

05_Principles_of_Dynamic_Programming_8_min_0_Slides_PDF_djvu.txt

719.0B

05_Principles_of_Dynamic_Programming_8_min_djvu.txt

1,004.0B

01_The_Knapsack_Problem_10_min_0_Slides_PDF_djvu.txt

1.3K

01_The_Knapsack_Problem_10_min_djvu.txt

916.0B

02_A_Dynamic_Programming_Algorithm_10_min_0_Slides_PDF_djvu.txt

1.3K

02_A_Dynamic_Programming_Algorithm_10_min_djvu.txt

330.0B

03_Example_Review_-_Optional_14_min_0_Slides_PDF_djvu.txt

272.0B

03_Example_Review_-_Optional_14_min_djvu.txt

1.4K

01_Optimal_Substructure_14_min_0_Slides_PDF_djvu.txt

2.0K

01_Optimal_Substructure_14_min_djvu.txt

1.6K

02_A_Dynamic_Programming_Algorithm_12_min_0_Slides_PDF_djvu.txt

1.9K

02_A_Dynamic_Programming_Algorithm_12_min_djvu.txt

1.3K

01_Problem_Definition_12_min_0_Slides_PDF_djvu.txt

1.5K

01_Problem_Definition_12_min_djvu.txt

1.4K

02_Optimal_Substructure_9_min_0_Slides_PDF_djvu.txt

2.4K

02_Optimal_Substructure_9_min_djvu.txt

1.4K

03_Proof_of_Optimal_Substructure_7_min_0_Slides_PDF_djvu.txt

2.4K

03_Proof_of_Optimal_Substructure_7_min_djvu.txt

1.5K

04_A_Dynamic_Programming_Algorithm_I_10_min_0_Slides_PDF_djvu.txt

2.1K

04_A_Dynamic_Programming_Algorithm_I_10_min_djvu.txt

1.5K

05_A_Dynamic_Programming_Algorithm_II_9_min_0_Slides_PDF_djvu.txt

2.1K

05_A_Dynamic_Programming_Algorithm_II_9_min_djvu.txt

1.2K

01_Single-Source_Shortest_Paths_Revisted_11_min_0_Slides_PDF_djvu.txt

1.6K

01_Single-Source_Shortest_Paths_Revisted_11_min_djvu.txt

1.5K

02_Optimal_Substructure_11_min_0_Slides_PDF_djvu.txt

1.8K

02_Optimal_Substructure_11_min_djvu.txt

1.6K

03_The_Basic_Algorithm_I_9_min_0_Slides_PDF_djvu.txt

1.9K

03_The_Basic_Algorithm_I_9_min_djvu.txt

1.6K

04_The_Basic_Algorithm_II_11_min_0_Slides_PDF_djvu.txt

1.9K

04_The_Basic_Algorithm_II_11_min_djvu.txt

908.0B

05_Detecting_Negative_Cycles_9_min_0_Slides_PDF_djvu.txt

978.0B

05_Detecting_Negative_Cycles_9_min_djvu.txt

1.3K

06_A_Space_Optimization_12_min_0_Slides_PDF_djvu.txt

1.9K

06_A_Space_Optimization_12_min_djvu.txt

1.2K

07_Internet_Routing_I_Optional_11_min_0_Slides_PDF_djvu.txt

1.4K

07_Internet_Routing_I_Optional_11_min_djvu.txt

1.2K

08_Internet_Routing_II_Optional_7_min_0_Slides_PDF_djvu.txt

1.4K

08_Internet_Routing_II_Optional_7_min_djvu.txt

618.0B

01_Problem_Definition_7_min_0_Slides_PDF_djvu.txt

819.0B

01_Problem_Definition_7_min_djvu.txt

1.4K

02_Optimal_Substructure_12_min_0_Slides_PDF_djvu.txt

1.5K

02_Optimal_Substructure_12_min_djvu.txt

1.0K

03_The_Floyd-Warshall_Algorithm_13_min_0_Slides_PDF_djvu.txt

1.3K

03_The_Floyd-Warshall_Algorithm_13_min_djvu.txt

1.4K

04_A_Reweighting_Technique_14_min_0_Slides_PDF_djvu.txt

1.8K

04_A_Reweighting_Technique_14_min_djvu.txt

1.9K

05_Johnsons_Algorithm_I_11_min_0_Slides_PDF_djvu.txt

2.3K

05_Johnsons_Algorithm_I_11_min_djvu.txt

1.9K

06_Johnsons_Algorithm_II_11_min_0_Slides_PDF_djvu.txt

2.3K

06_Johnsons_Algorithm_II_11_min_djvu.txt

1.4K

01_Polynomial-Time_Solvable_Problems_14_min_0_Slides_PDF_djvu.txt

1.6K

01_Polynomial-Time_Solvable_Problems_14_min_djvu.txt

1.2K

02_Reductions_and_Completeness_14_min_0_Slides_PDF_djvu.txt

1.5K

02_Reductions_and_Completeness_14_min_djvu.txt

1.4K

03_Definition_and_Interpretation_of_NP-Completeness_I_11_min_0_Slides_PDF_djvu.txt

1.7K

03_Definition_and_Interpretation_of_NP-Completeness_I_11_min_djvu.txt

1.4K

04_Definition_and_Interpretation_of_NP-Completeness_II_8_min_0_Slides_PDF_djvu.txt

1.7K

04_Definition_and_Interpretation_of_NP-Completeness_II_8_min_djvu.txt

625.0B

05_The_P_vs._NP_Question_9_min_0_Slides_PDF_djvu.txt

952.0B

05_The_P_vs._NP_Question_9_min_djvu.txt

672.0B

06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min_0_Slides_PDF_djvu.txt

1.0K

06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min_djvu.txt

924.0B

01_The_Vertex_Cover_Problem_9_min_0_Slides_PDF_djvu.txt

1,014.0B

01_The_Vertex_Cover_Problem_9_min_djvu.txt

1.7K

02_Smarter_Search_for_Vertex_Cover_I_10_min_0_Slides_PDF_djvu.txt

2.2K

02_Smarter_Search_for_Vertex_Cover_I_10_min_djvu.txt

1.7K

03_Smarter_Search_for_Vertex_Cover_II_8_min_0_Slides_PDF_djvu.txt

2.2K

03_Smarter_Search_for_Vertex_Cover_II_8_min_djvu.txt

2.0K

04_The_Traveling_Salesman_Problem_15_min_0_Slides_PDF_djvu.txt

2.6K

04_The_Traveling_Salesman_Problem_15_min_djvu.txt

1.3K

05_A_Dynamic_Programming_Algorithm_for_TSP_12_min_0_Slides_PDF_djvu.txt

1.6K

05_A_Dynamic_Programming_Algorithm_for_TSP_12_min_djvu.txt

1.7K

01_A_Greedy_Knapsack_Heuristic_14_min_0_Slides_PDF_djvu.txt

1.8K

01_A_Greedy_Knapsack_Heuristic_14_min_djvu.txt

2.0K

02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min_0_Slides_PDF_djvu.txt

2.4K

02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min_djvu.txt

2.0K

03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min_0_Slides_PDF_djvu.txt

2.4K

03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min_djvu.txt

1.1K

04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min_0_Slides_PDF_djvu.txt

1.5K

04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min_djvu.txt

1.1K

05_Knapsack_via_Dynamic_Programming_Revisited_10_min_0_Slides_PDF_djvu.txt

1.2K

05_Knapsack_via_Dynamic_Programming_Revisited_10_min_djvu.txt

1.6K

06_Ananysis_of_Dynamic_Programming_Heuristic_15_min_0_Slides_PDF_djvu.txt

1.7K

06_Ananysis_of_Dynamic_Programming_Heuristic_15_min_djvu.txt

1.9K

01_The_Maximum_Cut_Problem_I_9_min_0_Slides_PDF_djvu.txt

2.4K

01_The_Maximum_Cut_Problem_I_9_min_djvu.txt

1.9K

02_The_Maximum_Cut_Problem_II_9_min_0_Slides_PDF_djvu.txt

2.4K

02_The_Maximum_Cut_Problem_II_9_min_djvu.txt

1.3K

03_Principles_of_Local_Search_I_9_min_0_Slides_PDF_djvu.txt

2.0K

03_Principles_of_Local_Search_I_9_min_djvu.txt

1.3K

04_Principles_of_Local_Search_II_10_min_0_Slides_PDF_djvu.txt

2.0K

04_Principles_of_Local_Search_II_10_min_djvu.txt

1.2K

05_The_2-SAT_Problem_15_min_0_Slides_PDF_djvu.txt

1.4K

05_The_2-SAT_Problem_15_min_djvu.txt

865.0B

06_Random_Walks_on_a_Line_16_min_0_Slides_PDF_djvu.txt

1.5K

06_Random_Walks_on_a_Line_16_min_djvu.txt

1.5K

07_Analysis_of_Papadimitrious_Algorithm_15_min_0_Slides_PDF_djvu.txt

2.2K

07_Analysis_of_Papadimitrious_Algorithm_15_min_djvu.txt

3.1K

01_Stable_Matching_Optional_15_min_0_Slides_PDF_djvu.txt

3.4K

01_Stable_Matching_Optional_15_min_djvu.txt

3.1K

02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min_0_Slides_PDF_djvu.txt

3.4K

02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min_djvu.txt

3.1K

03_Linear_Programming_and_Beyond_Optional_11_min_0_Slides_PDF_djvu.txt

3.4K

03_Linear_Programming_and_Beyond_Optional_11_min_djvu.txt

30 files

HTML

BACK

98.1K

Assignments.html

143.8K

0_Problem_Set_1.html

101.5K

10_Problem_Set_6.html

47.9K

11_Programming_Assignment_6.html

47.9K

zip_page.html

42.8K

1_Programming_Assignment_1.html

42.8K

zip_page.html

93.2K

2_Problem_Set_2.html

54.8K

3_Programming_Assignment_2.html

54.8K

zip_page.html

112.5K

4_Problem_Set_3.html

41.4K

5_Programming_Assignment_3.html

41.4K

zip_page.html

103.6K

6_Problem_Set_4.html

50.6K

7_Programming_Assignment_4.html

50.6K

zip_page.html

78.1K

8_Problem_Set_5.html

52.6K

9_Programming_Assignment_5.html

52.6K

zip_page.html

35.3K

CourseLogisticsAssessment.html

59.2K

DiscussionForums.html

34.3K

Final Exam.html

31.7K

0_Final_Exam.html

62.0K

Home.html

38.5K

Syllabus.html

87.3K

TheoryOptionalProblems.html

36.0K

Tips.html

30.7K

assignment_home.html

62.1K

course_home.html

1.3M

entered_login.html

1 file

ITEM TILE

104 files

MPEG4

BACK

13.8M

01_Application-_Internet_Routing_11_min.mp4

11.1M

02_Application-_Sequence_Alignment_9_min.mp4

18.3M

01_About_the_Course_Part_I_Review_-_Optional_17_min.mp4

20.2M

02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.mp4

18.9M

03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.mp4

4.4M

04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.mp4

14.5M

05_Graph_Representations_Part_I_Review_-_Optional_14_min.mp4

24.4M

06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.mp4

21.9M

07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.mp4

4.9M

08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.mp4

19.5M

09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.mp4

18.0M

01_Introduction_to_Greedy_Algorithms_13_min.mp4

15.0M

02_Application-_Optimal_Caching_11_min.mp4

7.8M

01_Problem_Definition_6_min.mp4

17.2M

02_A_Greedy_Algorithm_13_min.mp4

9.2M

03_Correctness_Proof_-_Part_I_7_min.mp4

6.2M

04_Correctness_Proof_-_Part_II_5_min.mp4

9.7M

05_Handling_Ties_Advanced_-_Optional_7_min.mp4

15.0M

01_MST_Problem_Definition_11_min.mp4

10.0M

02_Prims_MST_Algorithm_8_min.mp4

19.0M

03_Correctness_Proof_I_16_min.mp4

10.1M

04_Correctness_Proof_II_8_min.mp4

15.0M

05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.mp4

19.7M

06_Fast_Implementation_I_15_min.mp4

13.2M

07_Fast_Implementation_II_10_min.mp4

11.0M

01_Kruskals_MST_Algorithm_8_min.mp4

12.3M

02_Correctness_of_Kruskals_Algorithm_9_min.mp4

12.9M

03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.mp4

18.9M

04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.mp4

14.2M

05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.mp4

15.1M

01_Application_to_Clustering_12_min.mp4

11.9M

02_Correctness_of_Clustering_Algorithm_10_min.mp4

15.2M

01_Lazy_Unions_Advanced_-_Optional_10_min.mp4

18.2M

02_Union-by-Rank_Advanced_-_Optional_12_min.mp4

22.3M

03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.mp4

21.5M

04_Path_Compression_Advanced_-_Optional_15_min.mp4

13.7M

05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.mp4

17.2M

06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.mp4

22.6M

07_The_Ackermann_Function_Advanced_-_Optional_17_min.mp4

20.8M

08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.mp4

19.1M

09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.mp4

11.9M

01_Introduction_and_Motivation_9_min.mp4

15.3M

02_Problem_Definition_10_min.mp4

24.7M

03_A_Greedy_Algorithm_17_min.mp4

5.5M

04_A_More_Complex_Example_4_min.mp4

13.3M

05_Correctness_Proof_I_10_min.mp4

16.8M

06_Correctness_Proof_II_13_min.mp4

11.3M

01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.mp4

13.5M

02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.mp4

14.5M

03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.mp4

9.6M

04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.mp4

12.3M

05_Principles_of_Dynamic_Programming_8_min.mp4

14.1M

01_The_Knapsack_Problem_10_min.mp4

13.6M

02_A_Dynamic_Programming_Algorithm_10_min.mp4

24.2M

03_Example_Review_-_Optional_14_min.mp4

19.5M

01_Optimal_Substructure_14_min.mp4

16.7M

02_A_Dynamic_Programming_Algorithm_12_min.mp4

17.2M

01_Problem_Definition_12_min.mp4

13.9M

02_Optimal_Substructure_9_min.mp4

9.9M

03_Proof_of_Optimal_Substructure_7_min.mp4

14.0M

04_A_Dynamic_Programming_Algorithm_I_10_min.mp4

11.9M

05_A_Dynamic_Programming_Algorithm_II_9_min.mp4

15.2M

01_Single-Source_Shortest_Paths_Revisted_11_min.mp4

15.3M

02_Optimal_Substructure_11_min.mp4

12.1M

03_The_Basic_Algorithm_I_9_min.mp4

13.6M

04_The_Basic_Algorithm_II_11_min.mp4

12.8M

05_Detecting_Negative_Cycles_9_min.mp4

18.3M

06_A_Space_Optimization_12_min.mp4

16.7M

07_Internet_Routing_I_Optional_11_min.mp4

10.7M

08_Internet_Routing_II_Optional_7_min.mp4

9.5M

01_Problem_Definition_7_min.mp4

16.5M

02_Optimal_Substructure_12_min.mp4

18.9M

03_The_Floyd-Warshall_Algorithm_13_min.mp4

19.6M

04_A_Reweighting_Technique_14_min.mp4

15.5M

05_Johnsons_Algorithm_I_11_min.mp4

16.9M

06_Johnsons_Algorithm_II_11_min.mp4

20.5M

01_Polynomial-Time_Solvable_Problems_14_min.mp4

19.9M

02_Reductions_and_Completeness_14_min.mp4

16.3M

03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.mp4

12.2M

04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.mp4

14.3M

05_The_P_vs._NP_Question_9_min.mp4

19.9M

06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.mp4

12.7M

01_The_Vertex_Cover_Problem_9_min.mp4

14.1M

02_Smarter_Search_for_Vertex_Cover_I_10_min.mp4

10.4M

03_Smarter_Search_for_Vertex_Cover_II_8_min.mp4

21.0M

04_The_Traveling_Salesman_Problem_15_min.mp4

17.4M

05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.mp4

18.7M

01_A_Greedy_Knapsack_Heuristic_14_min.mp4

8.9M

02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.mp4

12.4M

03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.mp4

15.4M

04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.mp4

13.2M

05_Knapsack_via_Dynamic_Programming_Revisited_10_min.mp4

18.7M

06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.mp4

12.4M

01_The_Maximum_Cut_Problem_I_9_min.mp4

12.8M

02_The_Maximum_Cut_Problem_II_9_min.mp4

12.2M

03_Principles_of_Local_Search_I_9_min.mp4

14.5M

04_Principles_of_Local_Search_II_10_min.mp4

19.6M

05_The_2-SAT_Problem_15_min.mp4

21.3M

06_Random_Walks_on_a_Line_16_min.mp4

21.6M

07_Analysis_of_Papadimitrious_Algorithm_15_min.mp4

22.5M

01_Stable_Matching_Optional_15_min.mp4

21.0M

02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.mp4

16.8M

03_Linear_Programming_and_Beyond_Optional_11_min.mp4

1.8M

04_Epilogue_1_min.mp4

104 files

OGG VIDEO

BACK

44.8M

01_Application-_Internet_Routing_11_min.ogv

37.3M

02_Application-_Sequence_Alignment_9_min.ogv

49.1M

01_About_the_Course_Part_I_Review_-_Optional_17_min.ogv

50.9M

02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.ogv

62.0M

03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.ogv

11.8M

04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.ogv

41.7M

05_Graph_Representations_Part_I_Review_-_Optional_14_min.ogv

76.3M

06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.ogv

66.5M

07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.ogv

13.0M

08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.ogv

58.5M

09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.ogv

53.9M

01_Introduction_to_Greedy_Algorithms_13_min.ogv

42.8M

02_Application-_Optimal_Caching_11_min.ogv

24.6M

01_Problem_Definition_6_min.ogv

55.4M

02_A_Greedy_Algorithm_13_min.ogv

29.0M

03_Correctness_Proof_-_Part_I_7_min.ogv

19.7M

04_Correctness_Proof_-_Part_II_5_min.ogv

30.5M

05_Handling_Ties_Advanced_-_Optional_7_min.ogv

47.2M

01_MST_Problem_Definition_11_min.ogv

29.9M

02_Prims_MST_Algorithm_8_min.ogv

64.1M

03_Correctness_Proof_I_16_min.ogv

33.0M

04_Correctness_Proof_II_8_min.ogv

48.9M

05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.ogv

62.8M

06_Fast_Implementation_I_15_min.ogv

41.7M

07_Fast_Implementation_II_10_min.ogv

32.0M

01_Kruskals_MST_Algorithm_8_min.ogv

39.6M

02_Correctness_of_Kruskals_Algorithm_9_min.ogv

39.6M

03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.ogv

58.2M

04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.ogv

39.3M

05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.ogv

47.9M

01_Application_to_Clustering_12_min.ogv

41.4M

02_Correctness_of_Clustering_Algorithm_10_min.ogv

42.0M

01_Lazy_Unions_Advanced_-_Optional_10_min.ogv

52.9M

02_Union-by-Rank_Advanced_-_Optional_12_min.ogv

63.2M

03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.ogv

62.6M

04_Path_Compression_Advanced_-_Optional_15_min.ogv

40.3M

05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.ogv

49.4M

06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.ogv

68.4M

07_The_Ackermann_Function_Advanced_-_Optional_17_min.ogv

60.6M

08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.ogv

57.5M

09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.ogv

40.0M

01_Introduction_and_Motivation_9_min.ogv

43.9M

02_Problem_Definition_10_min.ogv

71.6M

03_A_Greedy_Algorithm_17_min.ogv

17.1M

04_A_More_Complex_Example_4_min.ogv

43.2M

05_Correctness_Proof_I_10_min.ogv

53.4M

06_Correctness_Proof_II_13_min.ogv

33.1M

01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.ogv

39.7M

02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.ogv

41.6M

03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.ogv

29.3M

04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.ogv

33.8M

05_Principles_of_Dynamic_Programming_8_min.ogv

41.6M

01_The_Knapsack_Problem_10_min.ogv

42.3M

02_A_Dynamic_Programming_Algorithm_10_min.ogv

57.2M

03_Example_Review_-_Optional_14_min.ogv

57.4M

01_Optimal_Substructure_14_min.ogv

51.8M

02_A_Dynamic_Programming_Algorithm_12_min.ogv

51.5M

01_Problem_Definition_12_min.ogv

40.8M

02_Optimal_Substructure_9_min.ogv

28.2M

03_Proof_of_Optimal_Substructure_7_min.ogv

41.6M

04_A_Dynamic_Programming_Algorithm_I_10_min.ogv

39.6M

05_A_Dynamic_Programming_Algorithm_II_9_min.ogv

46.3M

01_Single-Source_Shortest_Paths_Revisted_11_min.ogv

45.8M

02_Optimal_Substructure_11_min.ogv

34.8M

03_The_Basic_Algorithm_I_9_min.ogv

44.6M

04_The_Basic_Algorithm_II_11_min.ogv

39.0M

05_Detecting_Negative_Cycles_9_min.ogv

51.9M

06_A_Space_Optimization_12_min.ogv

48.2M

07_Internet_Routing_I_Optional_11_min.ogv

28.9M

08_Internet_Routing_II_Optional_7_min.ogv

29.5M

01_Problem_Definition_7_min.ogv

50.2M

02_Optimal_Substructure_12_min.ogv

56.0M

03_The_Floyd-Warshall_Algorithm_13_min.ogv

58.8M

04_A_Reweighting_Technique_14_min.ogv

45.7M

05_Johnsons_Algorithm_I_11_min.ogv

48.8M

06_Johnsons_Algorithm_II_11_min.ogv

61.5M

01_Polynomial-Time_Solvable_Problems_14_min.ogv

55.9M

02_Reductions_and_Completeness_14_min.ogv

45.8M

03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.ogv

31.9M

04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.ogv

38.3M

05_The_P_vs._NP_Question_9_min.ogv

55.2M

06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.ogv

36.5M

01_The_Vertex_Cover_Problem_9_min.ogv

40.9M

02_Smarter_Search_for_Vertex_Cover_I_10_min.ogv

31.6M

03_Smarter_Search_for_Vertex_Cover_II_8_min.ogv

63.6M

04_The_Traveling_Salesman_Problem_15_min.ogv

51.7M

05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.ogv

59.6M

01_A_Greedy_Knapsack_Heuristic_14_min.ogv

29.2M

02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.ogv

38.8M

03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.ogv

49.5M

04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.ogv

44.4M

05_Knapsack_via_Dynamic_Programming_Revisited_10_min.ogv

62.8M

06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.ogv

36.0M

01_The_Maximum_Cut_Problem_I_9_min.ogv

39.7M

02_The_Maximum_Cut_Problem_II_9_min.ogv

38.5M

03_Principles_of_Local_Search_I_9_min.ogv

44.8M

04_Principles_of_Local_Search_II_10_min.ogv

59.6M

05_The_2-SAT_Problem_15_min.ogv

69.6M

06_Random_Walks_on_a_Line_16_min.ogv

63.5M

07_Analysis_of_Papadimitrious_Algorithm_15_min.ogv

62.4M

01_Stable_Matching_Optional_15_min.ogv

58.6M

02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.ogv

47.3M

03_Linear_Programming_and_Beyond_Optional_11_min.ogv

4.4M

04_Epilogue_1_min.ogv

206 files

PDF

BACK

90.8K

01_Application-_Internet_Routing_11_min.pdf

1.4M

01_Application-_Internet_Routing_11_min_0_Slides_PDF.pdf

102.4K

02_Application-_Sequence_Alignment_9_min.pdf

2.1M

02_Application-_Sequence_Alignment_9_min_0_Slides_PDF.pdf

731.4K

01_About_the_Course_Part_I_Review_-_Optional_17_min.pdf

209.1K

01_About_the_Course_Part_I_Review_-_Optional_17_min_0_Slides_PDF.pdf

729.1K

02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.pdf

1.2M

02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min_0_Slides_PDF.pdf

554.0K

03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.pdf

1.4M

03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min_0_Slides_PDF.pdf

812.0K

04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.pdf

660.3K

04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min_0_Slides_PDF.pdf

461.3K

05_Graph_Representations_Part_I_Review_-_Optional_14_min.pdf

1.8M

05_Graph_Representations_Part_I_Review_-_Optional_14_min_0_Slides_PDF.pdf

2.0M

06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.pdf

2.3M

06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min_0_Slides_PDF.pdf

432.7K

07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.pdf

2.7M

07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min_0_Slides_PDF.pdf

192.9K

08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.pdf

844.4K

08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min_0_Slides_PDF.pdf

220.9K

09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.pdf

2.1M

09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min_0_Slides_PDF.pdf

91.3K

01_Introduction_to_Greedy_Algorithms_13_min.pdf

1.7M

01_Introduction_to_Greedy_Algorithms_13_min_0_Slides_PDF.pdf

81.6K

02_Application-_Optimal_Caching_11_min.pdf

1.1M

02_Application-_Optimal_Caching_11_min_0_Slides_PDF.pdf

112.2K

01_Problem_Definition_6_min.pdf

944.1K

01_Problem_Definition_6_min_0_Slides_PDF.pdf

113.5K

02_A_Greedy_Algorithm_13_min.pdf

1.6M

02_A_Greedy_Algorithm_13_min_0_Slides_PDF.pdf

112.1K

03_Correctness_Proof_-_Part_I_7_min.pdf

1.3M

03_Correctness_Proof_-_Part_I_7_min_0_Slides_PDF.pdf

111.7K

04_Correctness_Proof_-_Part_II_5_min.pdf

950.3K

04_Correctness_Proof_-_Part_II_5_min_0_Slides_PDF.pdf

120.8K

05_Handling_Ties_Advanced_-_Optional_7_min.pdf

1.3M

05_Handling_Ties_Advanced_-_Optional_7_min_0_Slides_PDF.pdf

117.9K

01_MST_Problem_Definition_11_min.pdf

1.6M

01_MST_Problem_Definition_11_min_0_Slides_PDF.pdf

105.3K

02_Prims_MST_Algorithm_8_min.pdf

1.1M

02_Prims_MST_Algorithm_8_min_0_Slides_PDF.pdf

144.7K

03_Correctness_Proof_I_16_min.pdf

2.5M

03_Correctness_Proof_I_16_min_0_Slides_PDF.pdf

113.7K

04_Correctness_Proof_II_8_min.pdf

1.1M

04_Correctness_Proof_II_8_min_0_Slides_PDF.pdf

160.1K

05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.pdf

2.1M

05_Proof_of_Cut_Property_Advanced_-_Optional_12_min_0_Slides_PDF.pdf

139.1K

06_Fast_Implementation_I_15_min.pdf

3.3M

06_Fast_Implementation_I_15_min_0_Slides_PDF.pdf

139.1K

07_Fast_Implementation_II_10_min.pdf

3.3M

07_Fast_Implementation_II_10_min_0_Slides_PDF.pdf

104.9K

01_Kruskals_MST_Algorithm_8_min.pdf

751.7K

01_Kruskals_MST_Algorithm_8_min_0_Slides_PDF.pdf

118.6K

02_Correctness_of_Kruskals_Algorithm_9_min.pdf

1.6M

02_Correctness_of_Kruskals_Algorithm_9_min_0_Slides_PDF.pdf

138.5K

03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.pdf

3.4M

03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min_0_Slides_PDF.pdf

138.5K

04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.pdf

3.4M

04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min_0_Slides_PDF.pdf

103.8K

05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.pdf

1.2M

05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min_0_Slides_PDF.pdf

134.0K

01_Application_to_Clustering_12_min.pdf

1.8M

01_Application_to_Clustering_12_min_0_Slides_PDF.pdf

142.5K

02_Correctness_of_Clustering_Algorithm_10_min.pdf

1.6M

02_Correctness_of_Clustering_Algorithm_10_min_0_Slides_PDF.pdf

137.3K

01_Lazy_Unions_Advanced_-_Optional_10_min.pdf

1.6M

01_Lazy_Unions_Advanced_-_Optional_10_min_0_Slides_PDF.pdf

151.3K

02_Union-by-Rank_Advanced_-_Optional_12_min.pdf

2.1M

02_Union-by-Rank_Advanced_-_Optional_12_min_0_Slides_PDF.pdf

142.5K

03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.pdf

2.7M

03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min_0_Slides_PDF.pdf

141.3K

04_Path_Compression_Advanced_-_Optional_15_min.pdf

2.0M

04_Path_Compression_Advanced_-_Optional_15_min_0_Slides_PDF.pdf

154.6K

05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.pdf

3.0M

05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min_0_Slides_PDF.pdf

154.6K

06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.pdf

3.0M

06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min_0_Slides_PDF.pdf

160.3K

07_The_Ackermann_Function_Advanced_-_Optional_17_min.pdf

2.5M

07_The_Ackermann_Function_Advanced_-_Optional_17_min_0_Slides_PDF.pdf

181.2K

08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.pdf

3.4M

08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min_0_Slides_PDF.pdf

181.2K

09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.pdf

3.4M

09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min_0_Slides_PDF.pdf

99.1K

01_Introduction_and_Motivation_9_min.pdf

1.7M

01_Introduction_and_Motivation_9_min_0_Slides_PDF.pdf

163.8K

02_Problem_Definition_10_min.pdf

1.9M

02_Problem_Definition_10_min_0_Slides_PDF.pdf

183.6K

03_A_Greedy_Algorithm_17_min.pdf

2.7M

03_A_Greedy_Algorithm_17_min_0_Slides_PDF.pdf

85.9K

04_A_More_Complex_Example_4_min.pdf

807.8K

04_A_More_Complex_Example_4_min_0_Slides_PDF.pdf

173.3K

05_Correctness_Proof_I_10_min.pdf

3.5M

05_Correctness_Proof_I_10_min_0_Slides_PDF.pdf

173.3K

06_Correctness_Proof_II_13_min.pdf

3.5M

06_Correctness_Proof_II_13_min_0_Slides_PDF.pdf

102.1K

01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.pdf

1.2M

01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min_0_Slides_PDF.pdf

130.5K

02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.pdf

1.7M

02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min_0_Slides_PDF.pdf

122.3K

03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.pdf

1.6M

03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min_0_Slides_PDF.pdf

127.9K

04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.pdf

1.2M

04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min_0_Slides_PDF.pdf

107.2K

05_Principles_of_Dynamic_Programming_8_min.pdf

862.1K

05_Principles_of_Dynamic_Programming_8_min_0_Slides_PDF.pdf

119.5K

01_The_Knapsack_Problem_10_min.pdf

1.5M

01_The_Knapsack_Problem_10_min_0_Slides_PDF.pdf

120.9K

02_A_Dynamic_Programming_Algorithm_10_min.pdf

1.4M

02_A_Dynamic_Programming_Algorithm_10_min_0_Slides_PDF.pdf

139.9K

03_Example_Review_-_Optional_14_min.pdf

769.7K

03_Example_Review_-_Optional_14_min_0_Slides_PDF.pdf

142.3K

01_Optimal_Substructure_14_min.pdf

2.4M

01_Optimal_Substructure_14_min_0_Slides_PDF.pdf

156.8K

02_A_Dynamic_Programming_Algorithm_12_min.pdf

2.2M

02_A_Dynamic_Programming_Algorithm_12_min_0_Slides_PDF.pdf

161.4K

01_Problem_Definition_12_min.pdf

1.9M

01_Problem_Definition_12_min_0_Slides_PDF.pdf

172.5K

02_Optimal_Substructure_9_min.pdf

3.3M

02_Optimal_Substructure_9_min_0_Slides_PDF.pdf

172.5K

03_Proof_of_Optimal_Substructure_7_min.pdf

3.3M

03_Proof_of_Optimal_Substructure_7_min_0_Slides_PDF.pdf

227.1K

04_A_Dynamic_Programming_Algorithm_I_10_min.pdf

2.8M

04_A_Dynamic_Programming_Algorithm_I_10_min_0_Slides_PDF.pdf

227.1K

05_A_Dynamic_Programming_Algorithm_II_9_min.pdf

2.8M

05_A_Dynamic_Programming_Algorithm_II_9_min_0_Slides_PDF.pdf

118.3K

01_Single-Source_Shortest_Paths_Revisted_11_min.pdf

1.8M

01_Single-Source_Shortest_Paths_Revisted_11_min_0_Slides_PDF.pdf

132.9K

02_Optimal_Substructure_11_min.pdf

1.9M

02_Optimal_Substructure_11_min_0_Slides_PDF.pdf

189.0K

03_The_Basic_Algorithm_I_9_min.pdf

2.3M

03_The_Basic_Algorithm_I_9_min_0_Slides_PDF.pdf

189.0K

04_The_Basic_Algorithm_II_11_min.pdf

2.3M

04_The_Basic_Algorithm_II_11_min_0_Slides_PDF.pdf

130.2K

05_Detecting_Negative_Cycles_9_min.pdf

1.2M

05_Detecting_Negative_Cycles_9_min_0_Slides_PDF.pdf

130.3K

06_A_Space_Optimization_12_min.pdf

2.2M

06_A_Space_Optimization_12_min_0_Slides_PDF.pdf

125.2K

07_Internet_Routing_I_Optional_11_min.pdf

1.7M

07_Internet_Routing_I_Optional_11_min_0_Slides_PDF.pdf

125.2K

08_Internet_Routing_II_Optional_7_min.pdf

1.7M

08_Internet_Routing_II_Optional_7_min_0_Slides_PDF.pdf

111.6K

01_Problem_Definition_7_min.pdf

1.0M

01_Problem_Definition_7_min_0_Slides_PDF.pdf

136.7K

02_Optimal_Substructure_12_min.pdf

1.9M

02_Optimal_Substructure_12_min_0_Slides_PDF.pdf

128.0K

03_The_Floyd-Warshall_Algorithm_13_min.pdf

1.9M

03_The_Floyd-Warshall_Algorithm_13_min_0_Slides_PDF.pdf

183.3K

04_A_Reweighting_Technique_14_min.pdf

2.4M

04_A_Reweighting_Technique_14_min_0_Slides_PDF.pdf

167.3K

05_Johnsons_Algorithm_I_11_min.pdf

3.0M

05_Johnsons_Algorithm_I_11_min_0_Slides_PDF.pdf

167.3K

06_Johnsons_Algorithm_II_11_min.pdf

3.0M

06_Johnsons_Algorithm_II_11_min_0_Slides_PDF.pdf

124.5K

01_Polynomial-Time_Solvable_Problems_14_min.pdf

1.9M

01_Polynomial-Time_Solvable_Problems_14_min_0_Slides_PDF.pdf

83.0K

02_Reductions_and_Completeness_14_min.pdf

1.8M

02_Reductions_and_Completeness_14_min_0_Slides_PDF.pdf

91.2K

03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.pdf

2.2M

03_Definition_and_Interpretation_of_NP-Completeness_I_11_min_0_Slides_PDF.pdf

91.2K

04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.pdf

2.2M

04_Definition_and_Interpretation_of_NP-Completeness_II_8_min_0_Slides_PDF.pdf

92.7K

05_The_P_vs._NP_Question_9_min.pdf

1.3M

05_The_P_vs._NP_Question_9_min_0_Slides_PDF.pdf

102.7K

06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.pdf

1.1M

06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min_0_Slides_PDF.pdf

109.6K

01_The_Vertex_Cover_Problem_9_min.pdf

1.2M

01_The_Vertex_Cover_Problem_9_min_0_Slides_PDF.pdf

151.5K

02_Smarter_Search_for_Vertex_Cover_I_10_min.pdf

2.7M

02_Smarter_Search_for_Vertex_Cover_I_10_min_0_Slides_PDF.pdf

151.5K

03_Smarter_Search_for_Vertex_Cover_II_8_min.pdf

2.7M

03_Smarter_Search_for_Vertex_Cover_II_8_min_0_Slides_PDF.pdf

148.4K

04_The_Traveling_Salesman_Problem_15_min.pdf

2.9M

04_The_Traveling_Salesman_Problem_15_min_0_Slides_PDF.pdf

180.9K

05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.pdf

2.1M

05_A_Dynamic_Programming_Algorithm_for_TSP_12_min_0_Slides_PDF.pdf

124.5K

01_A_Greedy_Knapsack_Heuristic_14_min.pdf

2.1M

01_A_Greedy_Knapsack_Heuristic_14_min_0_Slides_PDF.pdf

152.3K

02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.pdf

2.7M

02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min_0_Slides_PDF.pdf

152.3K

03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.pdf

2.7M

03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min_0_Slides_PDF.pdf

106.6K

04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.pdf

1.7M

04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min_0_Slides_PDF.pdf

144.4K

05_Knapsack_via_Dynamic_Programming_Revisited_10_min.pdf

1.4M

05_Knapsack_via_Dynamic_Programming_Revisited_10_min_0_Slides_PDF.pdf

138.2K

06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.pdf

2.1M

06_Ananysis_of_Dynamic_Programming_Heuristic_15_min_0_Slides_PDF.pdf

194.6K

01_The_Maximum_Cut_Problem_I_9_min.pdf

3.1M

01_The_Maximum_Cut_Problem_I_9_min_0_Slides_PDF.pdf

194.6K

02_The_Maximum_Cut_Problem_II_9_min.pdf

3.1M

02_The_Maximum_Cut_Problem_II_9_min_0_Slides_PDF.pdf

110.9K

03_Principles_of_Local_Search_I_9_min.pdf

2.7M

03_Principles_of_Local_Search_I_9_min_0_Slides_PDF.pdf

110.9K

04_Principles_of_Local_Search_II_10_min.pdf

2.7M

04_Principles_of_Local_Search_II_10_min_0_Slides_PDF.pdf

121.2K

05_The_2-SAT_Problem_15_min.pdf

1.7M

05_The_2-SAT_Problem_15_min_0_Slides_PDF.pdf

202.1K

06_Random_Walks_on_a_Line_16_min.pdf

2.3M

06_Random_Walks_on_a_Line_16_min_0_Slides_PDF.pdf

142.1K

07_Analysis_of_Papadimitrious_Algorithm_15_min.pdf

2.5M

07_Analysis_of_Papadimitrious_Algorithm_15_min_0_Slides_PDF.pdf

160.7K

01_Stable_Matching_Optional_15_min.pdf

5.1M

01_Stable_Matching_Optional_15_min_0_Slides_PDF.pdf

160.7K

02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.pdf

5.1M

02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min_0_Slides_PDF.pdf

160.7K

03_Linear_Programming_and_Beyond_Optional_11_min.pdf

5.1M

03_Linear_Programming_and_Beyond_Optional_11_min_0_Slides_PDF.pdf

206 files

SINGLE PAGE PROCESSED JP2 ZIP

BACK

1.7M

01_Application-_Internet_Routing_11_min_0_Slides_PDF_jp2.zip

261.6K

01_Application-_Internet_Routing_11_min_jp2.zip

1.1M

02_Application-_Sequence_Alignment_9_min_0_Slides_PDF_jp2.zip

394.4K

02_Application-_Sequence_Alignment_9_min_jp2.zip

3.4M

01_About_the_Course_Part_I_Review_-_Optional_17_min_0_Slides_PDF_jp2.zip

3.4M

01_About_the_Course_Part_I_Review_-_Optional_17_min_jp2.zip

1.9M

02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min_0_Slides_PDF_jp2.zip

1.6M

02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min_jp2.zip

2.1M

03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min_0_Slides_PDF_jp2.zip

1.4M

03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min_jp2.zip

434.7K

04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min_0_Slides_PDF_jp2.zip

763.3K

04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min_jp2.zip

1.3M

05_Graph_Representations_Part_I_Review_-_Optional_14_min_0_Slides_PDF_jp2.zip

2.1M

05_Graph_Representations_Part_I_Review_-_Optional_14_min_jp2.zip

1.2M

06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min_0_Slides_PDF_jp2.zip

2.2M

06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min_jp2.zip

1.5M

07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min_0_Slides_PDF_jp2.zip

2.7M

07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min_jp2.zip

501.1K

08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min_0_Slides_PDF_jp2.zip

871.4K

08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min_jp2.zip

1.2M

09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min_0_Slides_PDF_jp2.zip

2.4M

09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min_jp2.zip

1,007.3K

01_Introduction_to_Greedy_Algorithms_13_min_0_Slides_PDF_jp2.zip

339.8K

01_Introduction_to_Greedy_Algorithms_13_min_jp2.zip

623.4K

02_Application-_Optimal_Caching_11_min_0_Slides_PDF_jp2.zip

218.3K

02_Application-_Optimal_Caching_11_min_jp2.zip

556.9K

01_Problem_Definition_6_min_0_Slides_PDF_jp2.zip

191.5K

01_Problem_Definition_6_min_jp2.zip

920.9K

02_A_Greedy_Algorithm_13_min_0_Slides_PDF_jp2.zip

316.0K

02_A_Greedy_Algorithm_13_min_jp2.zip

678.7K

03_Correctness_Proof_-_Part_I_7_min_0_Slides_PDF_jp2.zip

249.5K

03_Correctness_Proof_-_Part_I_7_min_jp2.zip

1.2M

04_Correctness_Proof_-_Part_II_5_min_0_Slides_PDF_jp2.zip

186.9K

04_Correctness_Proof_-_Part_II_5_min_jp2.zip

698.4K

05_Handling_Ties_Advanced_-_Optional_7_min_0_Slides_PDF_jp2.zip

251.8K

05_Handling_Ties_Advanced_-_Optional_7_min_jp2.zip

817.2K

01_MST_Problem_Definition_11_min_0_Slides_PDF_jp2.zip

291.3K

01_MST_Problem_Definition_11_min_jp2.zip

625.6K

02_Prims_MST_Algorithm_8_min_0_Slides_PDF_jp2.zip

243.6K

02_Prims_MST_Algorithm_8_min_jp2.zip

1.2M

03_Correctness_Proof_I_16_min_0_Slides_PDF_jp2.zip

446.0K

03_Correctness_Proof_I_16_min_jp2.zip

598.4K

04_Correctness_Proof_II_8_min_0_Slides_PDF_jp2.zip

217.5K

04_Correctness_Proof_II_8_min_jp2.zip

1.1M

05_Proof_of_Cut_Property_Advanced_-_Optional_12_min_0_Slides_PDF_jp2.zip

385.1K

05_Proof_of_Cut_Property_Advanced_-_Optional_12_min_jp2.zip

1.6M

06_Fast_Implementation_I_15_min_0_Slides_PDF_jp2.zip

515.5K

06_Fast_Implementation_I_15_min_jp2.zip

1.6M

07_Fast_Implementation_II_10_min_0_Slides_PDF_jp2.zip

515.5K

07_Fast_Implementation_II_10_min_jp2.zip

412.4K

01_Kruskals_MST_Algorithm_8_min_0_Slides_PDF_jp2.zip

155.3K

01_Kruskals_MST_Algorithm_8_min_jp2.zip

1.5M

02_Correctness_of_Kruskals_Algorithm_9_min_0_Slides_PDF_jp2.zip

259.4K

02_Correctness_of_Kruskals_Algorithm_9_min_jp2.zip

1.9M

03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min_0_Slides_PDF_jp2.zip

662.0K

03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min_jp2.zip

1.9M

04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min_0_Slides_PDF_jp2.zip

662.1K

04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min_jp2.zip

1.3M

05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min_0_Slides_PDF_jp2.zip

236.4K

05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min_jp2.zip

881.9K

01_Application_to_Clustering_12_min_0_Slides_PDF_jp2.zip

307.2K

01_Application_to_Clustering_12_min_jp2.zip

829.8K

02_Correctness_of_Clustering_Algorithm_10_min_0_Slides_PDF_jp2.zip

292.4K

02_Correctness_of_Clustering_Algorithm_10_min_jp2.zip

822.9K

01_Lazy_Unions_Advanced_-_Optional_10_min_0_Slides_PDF_jp2.zip

311.9K

01_Lazy_Unions_Advanced_-_Optional_10_min_jp2.zip

1.1M

02_Union-by-Rank_Advanced_-_Optional_12_min_0_Slides_PDF_jp2.zip

409.2K

02_Union-by-Rank_Advanced_-_Optional_12_min_jp2.zip

1.1M

03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min_0_Slides_PDF_jp2.zip

423.6K

03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min_jp2.zip

948.4K

04_Path_Compression_Advanced_-_Optional_15_min_0_Slides_PDF_jp2.zip

332.6K

04_Path_Compression_Advanced_-_Optional_15_min_jp2.zip

1.4M

05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min_0_Slides_PDF_jp2.zip

500.2K

05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min_jp2.zip

1.4M

06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min_0_Slides_PDF_jp2.zip

500.2K

06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min_jp2.zip

1.3M

07_The_Ackermann_Function_Advanced_-_Optional_17_min_0_Slides_PDF_jp2.zip

448.6K

07_The_Ackermann_Function_Advanced_-_Optional_17_min_jp2.zip

1.8M

08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min_0_Slides_PDF_jp2.zip

677.6K

08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min_jp2.zip

1.8M

09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min_0_Slides_PDF_jp2.zip

677.6K

09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min_jp2.zip

942.0K

01_Introduction_and_Motivation_9_min_0_Slides_PDF_jp2.zip

325.2K

01_Introduction_and_Motivation_9_min_jp2.zip

772.1K

02_Problem_Definition_10_min_0_Slides_PDF_jp2.zip

290.3K

02_Problem_Definition_10_min_jp2.zip

1.4M

03_A_Greedy_Algorithm_17_min_0_Slides_PDF_jp2.zip

477.4K

03_A_Greedy_Algorithm_17_min_jp2.zip

481.4K

04_A_More_Complex_Example_4_min_0_Slides_PDF_jp2.zip

171.9K

04_A_More_Complex_Example_4_min_jp2.zip

1.5M

05_Correctness_Proof_I_10_min_0_Slides_PDF_jp2.zip

547.6K

05_Correctness_Proof_I_10_min_jp2.zip

1.5M

06_Correctness_Proof_II_13_min_0_Slides_PDF_jp2.zip

547.7K

06_Correctness_Proof_II_13_min_jp2.zip

688.8K

01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min_0_Slides_PDF_jp2.zip

244.4K

01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min_jp2.zip

833.8K

02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min_0_Slides_PDF_jp2.zip

288.7K

02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min_jp2.zip

840.8K

03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min_0_Slides_PDF_jp2.zip

306.7K

03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min_jp2.zip

1.3M

04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min_0_Slides_PDF_jp2.zip

230.3K

04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min_jp2.zip

1.8M

05_Principles_of_Dynamic_Programming_8_min_0_Slides_PDF_jp2.zip

300.1K

05_Principles_of_Dynamic_Programming_8_min_jp2.zip

799.9K

01_The_Knapsack_Problem_10_min_0_Slides_PDF_jp2.zip

291.8K

01_The_Knapsack_Problem_10_min_jp2.zip

761.1K

02_A_Dynamic_Programming_Algorithm_10_min_0_Slides_PDF_jp2.zip

275.6K

02_A_Dynamic_Programming_Algorithm_10_min_jp2.zip

687.5K

03_Example_Review_-_Optional_14_min_0_Slides_PDF_jp2.zip

107.0K

03_Example_Review_-_Optional_14_min_jp2.zip

1.1M

01_Optimal_Substructure_14_min_0_Slides_PDF_jp2.zip

436.6K

01_Optimal_Substructure_14_min_jp2.zip

1.1M

02_A_Dynamic_Programming_Algorithm_12_min_0_Slides_PDF_jp2.zip

396.8K

02_A_Dynamic_Programming_Algorithm_12_min_jp2.zip

1.1M

01_Problem_Definition_12_min_0_Slides_PDF_jp2.zip

357.0K

01_Problem_Definition_12_min_jp2.zip

1.6M

02_Optimal_Substructure_9_min_0_Slides_PDF_jp2.zip

557.4K

02_Optimal_Substructure_9_min_jp2.zip

1.6M

03_Proof_of_Optimal_Substructure_7_min_0_Slides_PDF_jp2.zip

557.7K

03_Proof_of_Optimal_Substructure_7_min_jp2.zip

1.3M

04_A_Dynamic_Programming_Algorithm_I_10_min_0_Slides_PDF_jp2.zip

470.3K

04_A_Dynamic_Programming_Algorithm_I_10_min_jp2.zip

1.3M

05_A_Dynamic_Programming_Algorithm_II_9_min_0_Slides_PDF_jp2.zip

470.3K

05_A_Dynamic_Programming_Algorithm_II_9_min_jp2.zip

1,016.4K

01_Single-Source_Shortest_Paths_Revisted_11_min_0_Slides_PDF_jp2.zip

370.9K

01_Single-Source_Shortest_Paths_Revisted_11_min_jp2.zip

1.1M

02_Optimal_Substructure_11_min_0_Slides_PDF_jp2.zip

401.0K

02_Optimal_Substructure_11_min_jp2.zip

1.2M

03_The_Basic_Algorithm_I_9_min_0_Slides_PDF_jp2.zip

425.3K

03_The_Basic_Algorithm_I_9_min_jp2.zip

1.2M

04_The_Basic_Algorithm_II_11_min_0_Slides_PDF_jp2.zip

425.3K

04_The_Basic_Algorithm_II_11_min_jp2.zip

1.2M

05_Detecting_Negative_Cycles_9_min_0_Slides_PDF_jp2.zip

225.4K

05_Detecting_Negative_Cycles_9_min_jp2.zip

1.1M

06_A_Space_Optimization_12_min_0_Slides_PDF_jp2.zip

402.1K

06_A_Space_Optimization_12_min_jp2.zip

819.6K

07_Internet_Routing_I_Optional_11_min_0_Slides_PDF_jp2.zip

322.9K

07_Internet_Routing_I_Optional_11_min_jp2.zip

819.6K

08_Internet_Routing_II_Optional_7_min_0_Slides_PDF_jp2.zip

322.9K

08_Internet_Routing_II_Optional_7_min_jp2.zip

1.1M

01_Problem_Definition_7_min_0_Slides_PDF_jp2.zip

188.7K

01_Problem_Definition_7_min_jp2.zip

890.5K

02_Optimal_Substructure_12_min_0_Slides_PDF_jp2.zip

327.3K

02_Optimal_Substructure_12_min_jp2.zip

821.7K

03_The_Floyd-Warshall_Algorithm_13_min_0_Slides_PDF_jp2.zip

289.2K

03_The_Floyd-Warshall_Algorithm_13_min_jp2.zip

1.2M

04_A_Reweighting_Technique_14_min_0_Slides_PDF_jp2.zip

428.1K

04_A_Reweighting_Technique_14_min_jp2.zip

1.2M

05_Johnsons_Algorithm_I_11_min_0_Slides_PDF_jp2.zip

488.8K

05_Johnsons_Algorithm_I_11_min_jp2.zip

1.2M

06_Johnsons_Algorithm_II_11_min_0_Slides_PDF_jp2.zip

488.8K

06_Johnsons_Algorithm_II_11_min_jp2.zip

1,011.5K

01_Polynomial-Time_Solvable_Problems_14_min_0_Slides_PDF_jp2.zip

358.7K

01_Polynomial-Time_Solvable_Problems_14_min_jp2.zip

978.3K

02_Reductions_and_Completeness_14_min_0_Slides_PDF_jp2.zip

320.4K

02_Reductions_and_Completeness_14_min_jp2.zip

1.0M

03_Definition_and_Interpretation_of_NP-Completeness_I_11_min_0_Slides_PDF_jp2.zip

370.8K

03_Definition_and_Interpretation_of_NP-Completeness_I_11_min_jp2.zip

1.0M

04_Definition_and_Interpretation_of_NP-Completeness_II_8_min_0_Slides_PDF_jp2.zip

370.8K

04_Definition_and_Interpretation_of_NP-Completeness_II_8_min_jp2.zip

1.3M

05_The_P_vs._NP_Question_9_min_0_Slides_PDF_jp2.zip

226.5K

05_The_P_vs._NP_Question_9_min_jp2.zip

1.4M

06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min_0_Slides_PDF_jp2.zip

235.7K

06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min_jp2.zip

631.6K

01_The_Vertex_Cover_Problem_9_min_0_Slides_PDF_jp2.zip

226.3K

01_The_Vertex_Cover_Problem_9_min_jp2.zip

1.1M

02_Smarter_Search_for_Vertex_Cover_I_10_min_0_Slides_PDF_jp2.zip

424.2K

02_Smarter_Search_for_Vertex_Cover_I_10_min_jp2.zip

1.1M

03_Smarter_Search_for_Vertex_Cover_II_8_min_0_Slides_PDF_jp2.zip

424.2K

03_Smarter_Search_for_Vertex_Cover_II_8_min_jp2.zip

1.6M

04_The_Traveling_Salesman_Problem_15_min_0_Slides_PDF_jp2.zip

607.0K

04_The_Traveling_Salesman_Problem_15_min_jp2.zip

960.6K

05_A_Dynamic_Programming_Algorithm_for_TSP_12_min_0_Slides_PDF_jp2.zip

358.6K

05_A_Dynamic_Programming_Algorithm_for_TSP_12_min_jp2.zip

1.1M

01_A_Greedy_Knapsack_Heuristic_14_min_0_Slides_PDF_jp2.zip

404.4K

01_A_Greedy_Knapsack_Heuristic_14_min_jp2.zip

1.5M

02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min_0_Slides_PDF_jp2.zip

528.3K

02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min_jp2.zip

1.5M

03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min_0_Slides_PDF_jp2.zip

528.4K

03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min_jp2.zip

893.8K

04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min_0_Slides_PDF_jp2.zip

328.0K

04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min_jp2.zip

811.2K

05_Knapsack_via_Dynamic_Programming_Revisited_10_min_0_Slides_PDF_jp2.zip

280.5K

05_Knapsack_via_Dynamic_Programming_Revisited_10_min_jp2.zip

1.1M

06_Ananysis_of_Dynamic_Programming_Heuristic_15_min_0_Slides_PDF_jp2.zip

385.3K

06_Ananysis_of_Dynamic_Programming_Heuristic_15_min_jp2.zip

1.6M

01_The_Maximum_Cut_Problem_I_9_min_0_Slides_PDF_jp2.zip

545.9K

01_The_Maximum_Cut_Problem_I_9_min_jp2.zip

1.6M

02_The_Maximum_Cut_Problem_II_9_min_0_Slides_PDF_jp2.zip

545.9K

02_The_Maximum_Cut_Problem_II_9_min_jp2.zip

1.1M

03_Principles_of_Local_Search_I_9_min_0_Slides_PDF_jp2.zip

401.3K

03_Principles_of_Local_Search_I_9_min_jp2.zip

1.1M

04_Principles_of_Local_Search_II_10_min_0_Slides_PDF_jp2.zip

401.3K

04_Principles_of_Local_Search_II_10_min_jp2.zip

759.6K

05_The_2-SAT_Problem_15_min_0_Slides_PDF_jp2.zip

286.3K

05_The_2-SAT_Problem_15_min_jp2.zip

1.1M

06_Random_Walks_on_a_Line_16_min_0_Slides_PDF_jp2.zip

352.0K

06_Random_Walks_on_a_Line_16_min_jp2.zip

1.3M

07_Analysis_of_Papadimitrious_Algorithm_15_min_0_Slides_PDF_jp2.zip

463.4K

07_Analysis_of_Papadimitrious_Algorithm_15_min_jp2.zip

2.0M

01_Stable_Matching_Optional_15_min_0_Slides_PDF_jp2.zip

773.6K

01_Stable_Matching_Optional_15_min_jp2.zip

2.0M

02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min_0_Slides_PDF_jp2.zip

774.4K

02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min_jp2.zip

2.0M

03_Linear_Programming_and_Beyond_Optional_11_min_0_Slides_PDF_jp2.zip

774.2K

03_Linear_Programming_and_Beyond_Optional_11_min_jp2.zip

104 files

SUBRIP

BACK

17.8K

01_Application-_Internet_Routing_11_min.srt

13.3K

02_Application-_Sequence_Alignment_9_min.srt

31.4K

01_About_the_Course_Part_I_Review_-_Optional_17_min.srt

29.2K

02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.srt

25.3K

03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.srt

6.7K

04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.srt

23.7K

05_Graph_Representations_Part_I_Review_-_Optional_14_min.srt

40.2K

06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.srt

33.7K

07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.srt

7.5K

08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.srt

29.9K

09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.srt

21.7K

01_Introduction_to_Greedy_Algorithms_13_min.srt

17.0K

02_Application-_Optimal_Caching_11_min.srt

10.1K

01_Problem_Definition_6_min.srt

22.0K

02_A_Greedy_Algorithm_13_min.srt

11.6K

03_Correctness_Proof_-_Part_I_7_min.srt

6.9K

04_Correctness_Proof_-_Part_II_5_min.srt

11.7K

05_Handling_Ties_Advanced_-_Optional_7_min.srt

18.2K

01_MST_Problem_Definition_11_min.srt

12.7K

02_Prims_MST_Algorithm_8_min.srt

23.6K

03_Correctness_Proof_I_16_min.srt

12.7K

04_Correctness_Proof_II_8_min.srt

19.4K

05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.srt

23.5K

06_Fast_Implementation_I_15_min.srt

15.3K

07_Fast_Implementation_II_10_min.srt

13.3K

01_Kruskals_MST_Algorithm_8_min.srt

14.9K

02_Correctness_of_Kruskals_Algorithm_9_min.srt

15.7K

03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.srt

22.6K

04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.srt

14.9K

05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.srt

18.5K

01_Application_to_Clustering_12_min.srt

16.4K

02_Correctness_of_Clustering_Algorithm_10_min.srt

16.0K

01_Lazy_Unions_Advanced_-_Optional_10_min.srt

19.7K

02_Union-by-Rank_Advanced_-_Optional_12_min.srt

22.5K

03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.srt

22.0K

04_Path_Compression_Advanced_-_Optional_15_min.srt

14.1K

05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.srt

17.3K

06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.srt

21.8K

07_The_Ackermann_Function_Advanced_-_Optional_17_min.srt

21.2K

08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.srt

19.7K

09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.srt

14.4K

01_Introduction_and_Motivation_9_min.srt

15.5K

02_Problem_Definition_10_min.srt

26.4K

03_A_Greedy_Algorithm_17_min.srt

5.0K

04_A_More_Complex_Example_4_min.srt

15.8K

05_Correctness_Proof_I_10_min.srt

20.9K

06_Correctness_Proof_II_13_min.srt

13.1K

01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.srt

13.6K

02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.srt

15.6K

03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.srt

11.0K

04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.srt

12.4K

05_Principles_of_Dynamic_Programming_8_min.srt

14.4K

01_The_Knapsack_Problem_10_min.srt

14.8K

02_A_Dynamic_Programming_Algorithm_10_min.srt

21.6K

03_Example_Review_-_Optional_14_min.srt

21.1K

01_Optimal_Substructure_14_min.srt

19.1K

02_A_Dynamic_Programming_Algorithm_12_min.srt

20.2K

01_Problem_Definition_12_min.srt

15.6K

02_Optimal_Substructure_9_min.srt

9.7K

03_Proof_of_Optimal_Substructure_7_min.srt

16.3K

04_A_Dynamic_Programming_Algorithm_I_10_min.srt

15.4K

05_A_Dynamic_Programming_Algorithm_II_9_min.srt

17.5K

01_Single-Source_Shortest_Paths_Revisted_11_min.srt

16.5K

02_Optimal_Substructure_11_min.srt

12.5K

03_The_Basic_Algorithm_I_9_min.srt

16.1K

04_The_Basic_Algorithm_II_11_min.srt

14.3K

05_Detecting_Negative_Cycles_9_min.srt

18.6K

06_A_Space_Optimization_12_min.srt

18.9K

07_Internet_Routing_I_Optional_11_min.srt

11.1K

08_Internet_Routing_II_Optional_7_min.srt

11.1K

01_Problem_Definition_7_min.srt

19.8K

02_Optimal_Substructure_12_min.srt

21.6K

03_The_Floyd-Warshall_Algorithm_13_min.srt

20.6K

04_A_Reweighting_Technique_14_min.srt

15.7K

05_Johnsons_Algorithm_I_11_min.srt

16.9K

06_Johnsons_Algorithm_II_11_min.srt

21.4K

01_Polynomial-Time_Solvable_Problems_14_min.srt

19.9K

02_Reductions_and_Completeness_14_min.srt

15.7K

03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.srt

11.6K

04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.srt

13.2K

05_The_P_vs._NP_Question_9_min.srt

20.4K

06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.srt

13.4K

01_The_Vertex_Cover_Problem_9_min.srt

14.1K

02_Smarter_Search_for_Vertex_Cover_I_10_min.srt

11.4K

03_Smarter_Search_for_Vertex_Cover_II_8_min.srt

23.2K

04_The_Traveling_Salesman_Problem_15_min.srt

18.0K

05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.srt

21.2K

01_A_Greedy_Knapsack_Heuristic_14_min.srt

10.2K

02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.srt

15.1K

03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.srt

17.5K

04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.srt

15.5K

05_Knapsack_via_Dynamic_Programming_Revisited_10_min.srt

21.3K

06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.srt

12.7K

01_The_Maximum_Cut_Problem_I_9_min.srt

14.6K

02_The_Maximum_Cut_Problem_II_9_min.srt

14.5K

03_Principles_of_Local_Search_I_9_min.srt

17.7K

04_Principles_of_Local_Search_II_10_min.srt

22.4K

05_The_2-SAT_Problem_15_min.srt

24.2K

06_Random_Walks_on_a_Line_16_min.srt

21.5K

07_Analysis_of_Papadimitrious_Algorithm_15_min.srt

19.9K

01_Stable_Matching_Optional_15_min.srt

19.8K

02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.srt

17.1K

03_Linear_Programming_and_Beyond_Optional_11_min.srt

1.9K

04_Epilogue_1_min.srt

140 files

TEXT

BACK

12.0K

01_Application-_Internet_Routing_11_min.txt

8.9K

02_Application-_Sequence_Alignment_9_min.txt

20.9K

01_About_the_Course_Part_I_Review_-_Optional_17_min.txt

19.5K

02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.txt

17.0K

03_Guiding_Principles_for_Analysis_of_Algorithms_Part_I_Review_-_Optional_15_min.txt

4.5K

04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.txt

15.6K

05_Graph_Representations_Part_I_Review_-_Optional_14_min.txt

26.7K

06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.txt

22.4K

07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.txt

5.1K

08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.txt

20.0K

09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.txt

14.5K

01_Introduction_to_Greedy_Algorithms_13_min.txt

11.3K

02_Application-_Optimal_Caching_11_min.txt

6.7K

01_Problem_Definition_6_min.txt

14.6K

02_A_Greedy_Algorithm_13_min.txt

7.8K

03_Correctness_Proof_-_Part_I_7_min.txt

4.6K

04_Correctness_Proof_-_Part_II_5_min.txt

7.9K

05_Handling_Ties_Advanced_-_Optional_7_min.txt

12.2K

01_MST_Problem_Definition_11_min.txt

8.5K

02_Prims_MST_Algorithm_8_min.txt

15.5K

03_Correctness_Proof_I_16_min.txt

8.4K

04_Correctness_Proof_II_8_min.txt

12.8K

05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.txt

15.7K

06_Fast_Implementation_I_15_min.txt

10.2K

07_Fast_Implementation_II_10_min.txt

8.8K

01_Kruskals_MST_Algorithm_8_min.txt

9.9K

02_Correctness_of_Kruskals_Algorithm_9_min.txt

10.4K

03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.txt

14.9K

04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.txt

9.9K

05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.txt

12.3K

01_Application_to_Clustering_12_min.txt

10.9K

02_Correctness_of_Clustering_Algorithm_10_min.txt

10.7K

01_Lazy_Unions_Advanced_-_Optional_10_min.txt

13.1K

02_Union-by-Rank_Advanced_-_Optional_12_min.txt

15.0K

03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.txt

14.7K

04_Path_Compression_Advanced_-_Optional_15_min.txt

9.4K

05_Path_Compression-_The_Hopcroft-Ullman_Analysis_I_Advanced_-_Optional_9_min.txt

11.5K

06_Path_Compression-_The_Hopcroft-Ullman_Analysis_II_Advanced_-_Optional_12_min.txt

14.4K

07_The_Ackermann_Function_Advanced_-_Optional_17_min.txt

14.2K

08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.txt

13.2K

09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.txt

9.5K

01_Introduction_and_Motivation_9_min.txt

10.3K

02_Problem_Definition_10_min.txt

17.6K

03_A_Greedy_Algorithm_17_min.txt

3.4K

04_A_More_Complex_Example_4_min.txt

10.5K

05_Correctness_Proof_I_10_min.txt

13.9K

06_Correctness_Proof_II_13_min.txt

8.7K

01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.txt

9.1K

02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.txt

10.4K

03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.txt

7.4K

04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.txt

8.3K

05_Principles_of_Dynamic_Programming_8_min.txt

9.6K

01_The_Knapsack_Problem_10_min.txt

9.9K

02_A_Dynamic_Programming_Algorithm_10_min.txt

12.9K

03_Example_Review_-_Optional_14_min.txt

14.1K

01_Optimal_Substructure_14_min.txt

12.8K

02_A_Dynamic_Programming_Algorithm_12_min.txt

13.6K

01_Problem_Definition_12_min.txt

10.4K

02_Optimal_Substructure_9_min.txt

6.5K

03_Proof_of_Optimal_Substructure_7_min.txt

10.8K

04_A_Dynamic_Programming_Algorithm_I_10_min.txt

10.4K

05_A_Dynamic_Programming_Algorithm_II_9_min.txt

11.8K

01_Single-Source_Shortest_Paths_Revisted_11_min.txt

11.0K

02_Optimal_Substructure_11_min.txt

8.5K

03_The_Basic_Algorithm_I_9_min.txt

10.6K

04_The_Basic_Algorithm_II_11_min.txt

9.6K

05_Detecting_Negative_Cycles_9_min.txt

12.5K

06_A_Space_Optimization_12_min.txt

12.6K

07_Internet_Routing_I_Optional_11_min.txt

7.5K

08_Internet_Routing_II_Optional_7_min.txt

7.4K

01_Problem_Definition_7_min.txt

13.1K

02_Optimal_Substructure_12_min.txt

14.5K

03_The_Floyd-Warshall_Algorithm_13_min.txt

13.7K

04_A_Reweighting_Technique_14_min.txt

10.5K

05_Johnsons_Algorithm_I_11_min.txt

11.2K

06_Johnsons_Algorithm_II_11_min.txt

14.4K

01_Polynomial-Time_Solvable_Problems_14_min.txt

13.3K

02_Reductions_and_Completeness_14_min.txt

10.6K

03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.txt

7.9K

04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.txt

8.9K

05_The_P_vs._NP_Question_9_min.txt

13.8K

06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.txt

8.9K

01_The_Vertex_Cover_Problem_9_min.txt

9.5K

02_Smarter_Search_for_Vertex_Cover_I_10_min.txt

7.7K

03_Smarter_Search_for_Vertex_Cover_II_8_min.txt

15.3K

04_The_Traveling_Salesman_Problem_15_min.txt

12.1K

05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.txt

14.1K

01_A_Greedy_Knapsack_Heuristic_14_min.txt

6.8K

02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.txt

10.2K

03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.txt

11.8K

04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.txt

10.4K

05_Knapsack_via_Dynamic_Programming_Revisited_10_min.txt

14.3K

06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.txt

8.6K

01_The_Maximum_Cut_Problem_I_9_min.txt

9.9K

02_The_Maximum_Cut_Problem_II_9_min.txt

9.7K

03_Principles_of_Local_Search_I_9_min.txt

11.9K

04_Principles_of_Local_Search_II_10_min.txt

15.0K

05_The_2-SAT_Problem_15_min.txt

16.2K

06_Random_Walks_on_a_Line_16_min.txt

14.4K

07_Analysis_of_Papadimitrious_Algorithm_15_min.txt

13.3K

01_Stable_Matching_Optional_15_min.txt

13.3K

02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.txt

11.5K

03_Linear_Programming_and_Beyond_Optional_11_min.txt

1.2K

04_Epilogue_1_min.txt

1.4K

links.txt

1.4K

links.txt

1.2M

2sat1.txt

2.7M

2sat2.txt

5.5M

2sat3.txt

8.4M

2sat4.txt

11.2M

2sat5.txt

14.1M

2sat6.txt

1.7K

links.txt

27.6K

edges.txt

57.0K

jobs.txt

1.5K

links.txt

1.4K

links.txt

1.5M

clustering1.txt

9.3M

clustering_big.txt

1.5K

links.txt

1.4K

links.txt

987.0B

knapsack1.txt

25.0K

knapsack_big.txt

1.5K

links.txt

1.4K

links.txt

497.6K

g1.txt

497.7K

g2.txt

497.6K

g3.txt

13.2M

large.txt

1.6K

links.txt

1.4K

links.txt

1.5K

links.txt

552.0B

tsp.txt

1.3K

links.txt

1.2K

links.txt

1.4K

links.txt

2.3K

links.txt

1.3K

links.txt

1.4K

links.txt

1.3K

links.txt

1 file

TORRENT

1934 Files
7 Original

SHOW ALL

IN COLLECTIONS

Academic Torrents

The Dataset Collection

Uploaded by arkiver2 on August 12, 2018

[Coursera] Algorithms: Design and Analysis, Part 2 (Stanford University) (algo2)

Movies Preview

Flag this item for

[Coursera] Algorithms: Design and Analysis, Part 2 (Stanford University) (algo2)

plus-circle Add Review comment Reviews

DOWNLOAD OPTIONS

IN COLLECTIONS

SIMILAR ITEMS (based on metadata)

plus-circle Add Review

comment
Reviews