TorBT - Torrents and Magnet Links Search Engine
Latest Searches: sababa, bunny belt, librarians, matsushita%20saeko%2f, hentai+mom, popular music/, porn comic, breaking bad season 4, preteen models, color white

[Coursera] Algorithms II

Magnet Download Download Torrent
File Name
Size
9 - 3 - Knuth-Morris-Pratt (33_14).mp4
45 MB
4 - 5 - Prim's Algorithm (33_15).mp4
42 MB
8 - 1 - R-way Tries (32_19).mp4
41 MB
11 - 4 - LZW Compression (27_33).mp4
37 MB
2 - 3 - Depth-First Search (26_22).mp4
37 MB
11 - 1 - Introduction to Data Compression (22_27).mp4
36 MB
14 - 1 - Introduction to Intractability (17_00).mp4
34 MB
11 - 3 - Huffman Compression (24_14).mp4
34 MB
6 - 6 - Maxflow Applications (22_20).mp4
34 MB
10 - 5 - Regular Expression Applications (20_09).mp4
34 MB
8 - 3 - Character-Based Operations (20_03).mp4
33 MB
14 - 5 - NP-Completeness (12_38).mp4
32 MB
10 - 1 - Regular Expressions (20_03).mp4
31 MB
13 - 1 - Brewer's Problem (21_15).mp4
31 MB
13 - 3 - Simplex Implementations (16_21).mp4
30 MB
14 - 3 - P vs. NP (16_29).mp4
30 MB
7 - 6 - Suffix Arrays (19_25).mp4
30 MB
8 - 2 - Ternary Search Tries (22_42).mp4
29 MB
5 - 3 - Dijkstra's Algorithm (18_58).mp4
28 MB
5 - 5 - Negative Weights (21_01).mp4
28 MB
7 - 3 - LSD Radix Sort (15_00).mp4
28 MB
3 - 3 - Digraph Search (20_56).mp4
28 MB
5 - 4 - Edge-Weighted DAGs (19_23).mp4
26 MB
3 - 5 - Strong Components (20_22).mp4
26 MB
7 - 1 - Strings in Java (17_43).mp4
25 MB
2 - 5 - Connected Components (18_56).mp4
25 MB
9 - 5 - Rabin-Karp (16_13).mp4
25 MB
2 - 6 - Graph Challenges (14_29).mp4
24 MB
10 - 3 - NFA Simulation (18_27).mp4
24 MB
14 - 6 - Coping with Intractability (14_01).mp4
22 MB
14 - 4 - Classifying Problems (13_43).mp4
21 MB
14 - 2 - Search Problems (10_56).mp4
21 MB
13 - 4 - Linear Programming Reductions (11_46).mp4
21 MB
2 - 2 - Graph API (14_47).mp4
21 MB
5 - 2 - Shortest Path Properties (14_46).mp4
20 MB
6 - 5 - Java Implementation (14_29).mp4
19 MB
2 - 4 - Breadth-First Search (13_34).mp4
19 MB
10 - 2 - REs and NFAs (13_14).mp4
19 MB
7 - 4 - MSD Radix Sort (13_41).mp4
19 MB
12 - 4 - Classifying Problems (12_45).mp4
18 MB
4 - 2 - Greedy Algorithm (12_56).mp4
18 MB
12 - 1 - Introduction to Reductions (9_25).mp4
17 MB
3 - 4 - Topological Sort (12_54).mp4
17 MB
4 - 4 - Kruskal's Algorithm (12_28).mp4
17 MB
7 - 2 - Key-Indexed Counting (12_06).mp4
17 MB
10 - 4 - NFA Construction (11_42).mp4
17 MB
12 - 3 - Establishing Lower Bounds (9_16).mp4
16 MB
4 - 6 - MST Context (10_34).mp4
16 MB
13 - 2 - Simplex Algorithm (11_49).mp4
16 MB
5 - 1 - Shortest Paths APIs (10_51).mp4
16 MB
1 - 1 - Course Introduction (9_22).mp4
16 MB
4 - 3 - Edge-Weighted Graph API (11_15).mp4
15 MB
6 - 1 - Introduction to Maxflow (10_33).mp4
15 MB
2 - 1 - Introduction to Graphs (9_32).mp4
15 MB
9 - 2 - Brute-Force Substring Search (10_11).mp4
14 MB
3 - 1 - Introduction to Digraphs (8_30).mp4
13 MB
6 - 3 - Maxflow-Mincut Theorem (9_38).mp4
13 MB
6 - 4 - Running Time Analysis (8_49).mp4
13 MB
9 - 4 - Boyer-Moore (8_36).mp4
12 MB
7 - 5 - 3-way Radix Quicksort (7_22).mp4
12 MB
12 - 2 - Designing Algorithms (8_13).mp4
12 MB
11 - 2 - Run-Length Coding (5_59).mp4
9.1 MB
9 - 1 - Introduction to Substring Search (6_42).mp4
9.0 MB
6 - 2 - Ford-Fulkerson Algorithm (6_32).mp4
8.5 MB
3 - 2 - Digraph API (4_56).mp4
7.2 MB
4 - 1 - Introduction to MSTs (4_04).mp4
6.8 MB
4 - 5 - Prim's Algorithm (33_15).srt
39 kB
9 - 3 - Knuth-Morris-Pratt (33_14).srt
38 kB
8 - 1 - R-way Tries (32_19).srt
38 kB
2 - 3 - Depth-First Search (26_22).srt
31 kB
11 - 4 - LZW Compression (27_33).srt
28 kB
11 - 3 - Huffman Compression (24_14).srt
26 kB
8 - 2 - Ternary Search Tries (22_42).srt
26 kB
6 - 6 - Maxflow Applications (22_20).srt
26 kB
11 - 1 - Introduction to Data Compression (22_27).srt
26 kB
5 - 5 - Negative Weights (21_01).srt
24 kB
3 - 5 - Strong Components (20_22).srt
24 kB
13 - 1 - Brewer's Problem (21_15).srt
23 kB
5 - 4 - Edge-Weighted DAGs (19_23).srt
23 kB
10 - 1 - Regular Expressions (20_03).srt
23 kB
5 - 3 - Dijkstra's Algorithm (18_58).srt
22 kB
7 - 6 - Suffix Arrays (19_25).srt
22 kB
2 - 5 - Connected Components (18_56).srt
22 kB
3 - 3 - Digraph Search (20_56).srt
22 kB
10 - 5 - Regular Expression Applications (20_09).srt
22 kB
8 - 3 - Character-Based Operations (20_03).srt
22 kB
7 - 1 - Strings in Java (17_43).srt
21 kB
14 - 1 - Introduction to Intractability (17_00).srt
20 kB
10 - 3 - NFA Simulation (18_27).srt
20 kB
14 - 3 - P vs. NP (16_29).srt
18 kB
13 - 3 - Simplex Implementations (16_21).srt
18 kB
7 - 3 - LSD Radix Sort (15_00).srt
18 kB
9 - 5 - Rabin-Karp (16_13).srt
17 kB
2 - 6 - Graph Challenges (14_29).srt
17 kB
2 - 2 - Graph API (14_47).srt
16 kB
6 - 5 - Java Implementation (14_29).srt
16 kB
5 - 2 - Shortest Path Properties (14_46).srt
16 kB
4 - 2 - Greedy Algorithm (12_56).srt
16 kB
7 - 4 - MSD Radix Sort (13_41).srt
16 kB
2 - 4 - Breadth-First Search (13_34).srt
16 kB
10 - 2 - REs and NFAs (13_14).srt
15 kB
3 - 4 - Topological Sort (12_54).srt
15 kB
14 - 4 - Classifying Problems (13_43).srt
14 kB
12 - 4 - Classifying Problems (12_45).srt
14 kB
14 - 6 - Coping with Intractability (14_01).srt
14 kB
4 - 4 - Kruskal's Algorithm (12_28).srt
14 kB
14 - 5 - NP-Completeness (12_38).srt
14 kB
13 - 4 - Linear Programming Reductions (11_46).srt
13 kB
5 - 1 - Shortest Paths APIs (10_51).srt
13 kB
6 - 1 - Introduction to Maxflow (10_33).srt
13 kB
7 - 2 - Key-Indexed Counting (12_06).srt
13 kB
1 - 1 - Course Introduction (9_22).srt
13 kB
14 - 2 - Search Problems (10_56).srt
13 kB
10 - 4 - NFA Construction (11_42).srt
12 kB
12 - 1 - Introduction to Reductions (9_25).srt
12 kB
4 - 3 - Edge-Weighted Graph API (11_15).srt
12 kB
13 - 2 - Simplex Algorithm (11_49).srt
12 kB
9 - 2 - Brute-Force Substring Search (10_11).srt
12 kB
4 - 6 - MST Context (10_34).srt
12 kB
2 - 1 - Introduction to Graphs (9_32).srt
12 kB
6 - 3 - Maxflow-Mincut Theorem (9_38).srt
11 kB
12 - 3 - Establishing Lower Bounds (9_16).srt
11 kB
3 - 1 - Introduction to Digraphs (8_30).srt
10 kB
6 - 4 - Running Time Analysis (8_49).srt
9.9 kB
9 - 4 - Boyer-Moore (8_36).srt
9.7 kB
12 - 2 - Designing Algorithms (8_13).srt
9.5 kB
7 - 5 - 3-way Radix Quicksort (7_22).srt
8.2 kB
9 - 1 - Introduction to Substring Search (6_42).srt
7.7 kB
6 - 2 - Ford-Fulkerson Algorithm (6_32).srt
7.6 kB
11 - 2 - Run-Length Coding (5_59).srt
6.3 kB
_README.txt
6.1 kB
3 - 2 - Digraph API (4_56).srt
5.3 kB
4 - 1 - Introduction to MSTs (4_04).srt
4.4 kB