23 OCT 2025 - We are back!
If you have been following us over the last few years, you will know that the last 2 months have been rough.
We website was practically not loading.
Sorry for the mess. We are back though and everything should run smoothly now. New servers. Updated domains. And new owners.
We invite you all to start uploading torrents again!

TORRENT DETAILS

Algo2-Stanford

TORRENT SUMMARY

	Status:	This torrent has NOT been verified.
Category:	Other
Infohash	5e08cb06a704c7cfb06d4b566416fb512340c78c
Size:	1.7 GB in 99 files
Release Date(s):	Torrent Release: 16-05-2014 by user
Swarm:	0 Seeds & 1 Peers
Vote:	No votes yet.

DESCRIPTION

VISITOR COMMENTS (0

)

FILE LIST

Filename		Size
	1 - 1 - Application- Internet Routing (11 min).mp4	13.8 MB
	1 - 2 - Application- Sequence Alignment (9 min).mp4	11.1 MB
	10 - 1 - Introduction- Weighted Independent Sets in Path Graphs (8 min).mp4	11.3 MB
	10 - 2 - WIS in Path Graphs- Optimal Substructure (9 min).mp4	13.5 MB
	10 - 3 - WIS in Path Graphs- A Linear-Time Algorithm (10 min).mp4	14.5 MB
	10 - 4 - WIS in Path Graphs- A Reconstruction Algorithm (7 min).mp4	9.6 MB
	10 - 5 - Principles of Dynamic Programming (8 min).mp4	12.3 MB
	11 - 1 - The Knapsack Problem (10 min).mp4	14.1 MB
	11 - 2 - A Dynamic Programming Algorithm (10 min).mp4	13.6 MB
	11 - 3 - Example [Review - Optional] (14 min).mp4	24.2 MB
	12 - 1 - Optimal Substructure (14 min).mp4	19.5 MB
	12 - 2 - A Dynamic Programming Algorithm (12 min).mp4	16.7 MB
	13 - 1 - Problem Definition (12 min).mp4	17.2 MB
	13 - 2 - Optimal Substructure (9 min).mp4	13.9 MB
	13 - 3 - Proof of Optimal Substructure (7 min) (1).mp4	9.9 MB
	13 - 3 - Proof of Optimal Substructure (7 min).mp4	9.9 MB
	13 - 4 - A Dynamic Programming Algorithm I (10 min) (1).mp4	14 MB
	13 - 4 - A Dynamic Programming Algorithm I (10 min).mp4	14 MB
	13 - 5 - A Dynamic Programming Algorithm II (9 min) (1).mp4	11.9 MB
	13 - 5 - A Dynamic Programming Algorithm II (9 min).mp4	11.9 MB
	14 - 1 - Single-Source Shortest Paths, Revisted (11 min) (1).mp4	15.2 MB
	14 - 1 - Single-Source Shortest Paths, Revisted (11 min).mp4	15.2 MB
	14 - 2 - Optimal Substructure (11 min) (1).mp4	15.3 MB
	14 - 2 - Optimal Substructure (11 min).mp4	15.3 MB
	14 - 3 - The Basic Algorithm I (9 min) (1).mp4	12.1 MB
	14 - 3 - The Basic Algorithm I (9 min).mp4	12.1 MB
	14 - 4 - The Basic Algorithm II (11 min) (1).mp4	13.6 MB
	14 - 4 - The Basic Algorithm II (11 min).mp4	13.6 MB
	14 - 5 - Detecting Negative Cycles (9 min) (1).mp4	12.8 MB
	14 - 5 - Detecting Negative Cycles (9 min).mp4	12.8 MB
	14 - 6 - A Space Optimization (12 min) (1).mp4	18.3 MB
	14 - 6 - A Space Optimization (12 min).mp4	18.3 MB
	14 - 7 - Internet Routing I [Optional] (11 min) (1).mp4	16.7 MB
	14 - 7 - Internet Routing I [Optional] (11 min).mp4	16.7 MB
	14 - 8 - Internet Routing II [Optional] (7 min) (1).mp4	10.7 MB
	14 - 8 - Internet Routing II [Optional] (7 min).mp4	10.7 MB
	15 - 1 - Problem Definition (7 min) (1).mp4	9.5 MB
	15 - 1 - Problem Definition (7 min) (2).mp4	9.5 MB
	15 - 1 - Problem Definition (7 min).mp4	9.5 MB
	15 - 2 - Optimal Substructure (12 min) (1).mp4	16.5 MB
	15 - 2 - Optimal Substructure (12 min).mp4	16.5 MB
	15 - 3 - The Floyd-Warshall Algorithm (13 min).mp4	18.9 MB
	15 - 4 - A Reweighting Technique (14 min).mp4	19.6 MB
	15 - 5 - Johnson-'s Algorithm I (11 min).mp4	15.5 MB
	15 - 6 - Johnson-'s Algorithm II (11 min).mp4	16.9 MB
	16 - 1 - Polynomial-Time Solvable Problems (14 min).mp4	20.5 MB
	16 - 2 - Reductions and Completeness (14 min).mp4	19.9 MB
	16 - 3 - Definition and Interpretation of NP-Completeness I (11 min).mp4	16.3 MB
	16 - 4 - Definition and Interpretation of NP-Completeness II (8 min).mp4	12.2 MB
	16 - 5 - The P vs. NP Question (9 min).mp4	14.3 MB
	16 - 6 - Algorithmic Approaches to NP-Complete Problems (13 min).mp4	19.9 MB
	17 - 1 - The Vertex Cover Problem (9 min).mp4	12.7 MB
	17 - 2 - Smarter Search for Vertex Cover I (10 min).mp4	14.1 MB
	17 - 3 - Smarter Search for Vertex Cover II (8 min).mp4	10.4 MB
	17 - 4 - The Traveling Salesman Problem (15 min).mp4	21 MB
	17 - 5 - A Dynamic Programming Algorithm for TSP (12 min).mp4	17.4 MB
	18 - 1 - A Greedy Knapsack Heuristic (14 min).mp4	18.7 MB
	18 - 2 - Analysis of a Greedy Knapsack Heuristic I (7 min).mp4	8.9 MB
	18 - 3 - Analysis of a Greedy Knapsack Heuristic II (10 min).mp4	12.4 MB
	18 - 4 - A Dynamic Programming Heuristic for Knapsack (12 min).mp4	15.4 MB
	18 - 5 - Knapsack via Dynamic Programming, Revisited (10 min).mp4	13.2 MB
	18 - 6 - Ananysis of Dynamic Programming Heuristic (15 min).mp4	18.7 MB
	19 - 1 - The Maximum Cut Problem I (9 min).mp4	12.4 MB
	19 - 2 - The Maximum Cut Problem II (9 min).mp4	12.8 MB
	19 - 3 - Principles of Local Search I (9 min).mp4	12.2 MB
	19 - 4 - Principles of Local Search II (10 min).mp4	14.5 MB
	19 - 5 - The 2-SAT Problem (15 min).mp4	19.6 MB
	19 - 6 - Random Walks on a Line (16 min).mp4	21.3 MB
	19 - 7 - Analysis of Papadimitriou-'s Algorithm (15 min).mp4	21.6 MB
	2 - 1 - About the Course [Part I Review - Optional] (17 min).mp4	18.3 MB
	2 - 2 - Why Study Algorithms- [Part I Review - Optional] (19 min).mp4	20.2 MB
	2 - 3 - Guiding Principles for Analysis of Algorithms [Part I Review - Optional] (15 min).mp4	18.9 MB
	2 - 4 - Big-Oh Notation [Part I Review - Optional] (4 min).mp4	4.4 MB
	2 - 5 - Graph Representations [Part I Review - Optional] (14 min).mp4	14.5 MB
	2 - 6 - Graph Search - Overview [Part I Review - Optional] (23 min).mp4	24.4 MB
	2 - 7 - Dijkstra-'s Shortest-Path Algorithm [Part I Review - Optional] (21 min).mp4	21.9 MB
	2 - 8 - Data Structures- Overview [Part I Review - Optional] (5 min).mp4	4.9 MB
	2 - 9 - Heaps- Operations and Applications [Part I Review - Optional] (18 min).mp4	19.5 MB
	20 - 1 - Stable Matching [Optional] (15 min).mp4	22.5 MB
	20 - 2 - Matchings, Flows, and Braess-'s Paradox [Optional] (14 min).mp4	21 MB
	20 - 3 - Linear Programming and Beyond [Optional] (11 min).mp4	16.8 MB
	20 - 4 - Epilogue (1 min).mp4	1.8 MB
	3 - 1 - Introduction to Greedy Algorithms (13 min).mp4	18 MB
	3 - 2 - Application- Optimal Caching (11 min).mp4	15 MB
	4 - 1 - Problem Definition (6 min).mp4	7.8 MB
	4 - 2 - A Greedy Algorithm (13 min).mp4	17.2 MB
	4 - 3 - Correctness Proof - Part I (7 min).mp4	9.2 MB
	4 - 4 - Correctness Proof - Part II (5 min).mp4	6.2 MB
	4 - 5 - Handling Ties [Advanced - Optional] (7 min).mp4	9.7 MB
	5 - 1 - MST Problem Definition (11 min).mp4	15 MB
	5 - 2 - Prim-'s MST Algorithm (8 min).mp4	10 MB
	5 - 3 - Correctness Proof I (16 min).mp4	19 MB
	5 - 4 - Correctness Proof II (8 min).mp4	10.1 MB
	5 - 5 - Proof of Cut Property [Advanced - Optional] (12 min).mp4	60.8 KB
	5 - 6 - Fast Implementation I (15 min).mp4	19.7 MB
	5 - 7 - Fast Implementation II (10 min).mp4	13.2 MB
	6 - 1 - Kruskal-'s MST Algorithm (8 min).mp4	11 MB
	6 - 2 - Correctness of Kruskal-'s Algorithm (9 min).mp4	12.3 MB
	6 - 3 - Implementing Kruskal-'s Algorithm via Union-Find I (9 min).mp4	12.9 MB

RELATED DOWNLOADS

No related downloads found.