Create Tool:
Create Time:1970-01-01 08:00:00
File Size:1484.48 MB
File Count:133
File Hash:249012dfc0704687885bbe4235481a5501fa52e1
| 9 - 3 - Knuth-Morris-Pratt (33_14).mp4 | 45.04 MB |
| 4 - 5 - Prim's Algorithm (33_15).mp4 | 42.28 MB |
| 8 - 1 - R-way Tries (32_19).mp4 | 40.89 MB |
| 11 - 4 - LZW Compression (27_33).mp4 | 37.15 MB |
| 2 - 3 - Depth-First Search (26_22).mp4 | 36.97 MB |
| 11 - 1 - Introduction to Data Compression (22_27).mp4 | 36.04 MB |
| 14 - 1 - Introduction to Intractability (17_00).mp4 | 34.49 MB |
| 11 - 3 - Huffman Compression (24_14).mp4 | 34.02 MB |
| 6 - 6 - Maxflow Applications (22_20).mp4 | 33.91 MB |
| 10 - 5 - Regular Expression Applications (20_09).mp4 | 33.80 MB |
| 8 - 3 - Character-Based Operations (20_03).mp4 | 32.72 MB |
| 14 - 5 - NP-Completeness (12_38).mp4 | 31.80 MB |
| 10 - 1 - Regular Expressions (20_03).mp4 | 30.83 MB |
| 13 - 1 - Brewer's Problem (21_15).mp4 | 30.55 MB |
| 13 - 3 - Simplex Implementations (16_21).mp4 | 30.05 MB |
| 14 - 3 - P vs. NP (16_29).mp4 | 29.95 MB |
| 7 - 6 - Suffix Arrays (19_25).mp4 | 29.63 MB |
| 8 - 2 - Ternary Search Tries (22_42).mp4 | 29.27 MB |
| 5 - 3 - Dijkstra's Algorithm (18_58).mp4 | 28.09 MB |
| 5 - 5 - Negative Weights (21_01).mp4 | 27.84 MB |
| 7 - 3 - LSD Radix Sort (15_00).mp4 | 27.68 MB |
| 3 - 3 - Digraph Search (20_56).mp4 | 27.59 MB |
| 5 - 4 - Edge-Weighted DAGs (19_23).mp4 | 26.49 MB |
| 3 - 5 - Strong Components (20_22).mp4 | 26.06 MB |
| 7 - 1 - Strings in Java (17_43).mp4 | 25.38 MB |
| 2 - 5 - Connected Components (18_56).mp4 | 24.75 MB |
| 9 - 5 - Rabin-Karp (16_13).mp4 | 24.58 MB |
| 2 - 6 - Graph Challenges (14_29).mp4 | 24.32 MB |
| 10 - 3 - NFA Simulation (18_27).mp4 | 23.88 MB |
| 14 - 6 - Coping with Intractability (14_01).mp4 | 21.66 MB |
| 14 - 4 - Classifying Problems (13_43).mp4 | 21.37 MB |
| 14 - 2 - Search Problems (10_56).mp4 | 21.23 MB |
| 13 - 4 - Linear Programming Reductions (11_46).mp4 | 20.79 MB |
| 2 - 2 - Graph API (14_47).mp4 | 20.58 MB |
| 5 - 2 - Shortest Path Properties (14_46).mp4 | 19.77 MB |
| 6 - 5 - Java Implementation (14_29).mp4 | 19.15 MB |
| 2 - 4 - Breadth-First Search (13_34).mp4 | 19.07 MB |
| 10 - 2 - REs and NFAs (13_14).mp4 | 19.06 MB |
| 7 - 4 - MSD Radix Sort (13_41).mp4 | 19.04 MB |
| 12 - 4 - Classifying Problems (12_45).mp4 | 18.52 MB |
| 4 - 2 - Greedy Algorithm (12_56).mp4 | 18.29 MB |
| 12 - 1 - Introduction to Reductions (9_25).mp4 | 17.45 MB |
| 3 - 4 - Topological Sort (12_54).mp4 | 16.88 MB |
| 4 - 4 - Kruskal's Algorithm (12_28).mp4 | 16.87 MB |
| 7 - 2 - Key-Indexed Counting (12_06).mp4 | 16.76 MB |
| 10 - 4 - NFA Construction (11_42).mp4 | 16.56 MB |
| 12 - 3 - Establishing Lower Bounds (9_16).mp4 | 16.45 MB |
| 4 - 6 - MST Context (10_34).mp4 | 16.42 MB |
| 13 - 2 - Simplex Algorithm (11_49).mp4 | 16.12 MB |
| 5 - 1 - Shortest Paths APIs (10_51).mp4 | 15.67 MB |
| 1 - 1 - Course Introduction (9_22).mp4 | 15.60 MB |
| 4 - 3 - Edge-Weighted Graph API (11_15).mp4 | 15.12 MB |
| 6 - 1 - Introduction to Maxflow (10_33).mp4 | 14.99 MB |
| 2 - 1 - Introduction to Graphs (9_32).mp4 | 14.57 MB |
| 9 - 2 - Brute-Force Substring Search (10_11).mp4 | 14.13 MB |
| 3 - 1 - Introduction to Digraphs (8_30).mp4 | 13.31 MB |
| 6 - 3 - Maxflow-Mincut Theorem (9_38).mp4 | 12.78 MB |
| 6 - 4 - Running Time Analysis (8_49).mp4 | 12.67 MB |
| 9 - 4 - Boyer-Moore (8_36).mp4 | 12.01 MB |
| 7 - 5 - 3-way Radix Quicksort (7_22).mp4 | 11.91 MB |
| 12 - 2 - Designing Algorithms (8_13).mp4 | 11.87 MB |
| 11 - 2 - Run-Length Coding (5_59).mp4 | 9.11 MB |
| 9 - 1 - Introduction to Substring Search (6_42).mp4 | 9.04 MB |
| 6 - 2 - Ford-Fulkerson Algorithm (6_32).mp4 | 8.51 MB |
| 3 - 2 - Digraph API (4_56).mp4 | 7.21 MB |
| 4 - 1 - Introduction to MSTs (4_04).mp4 | 6.76 MB |
| 4 - 5 - Prim's Algorithm (33_15).srt | 38.98 KB |
| 9 - 3 - Knuth-Morris-Pratt (33_14).srt | 38.17 KB |
| 8 - 1 - R-way Tries (32_19).srt | 37.97 KB |
| 2 - 3 - Depth-First Search (26_22).srt | 31.03 KB |
| 11 - 4 - LZW Compression (27_33).srt | 27.74 KB |
| 11 - 3 - Huffman Compression (24_14).srt | 26.39 KB |
| 8 - 2 - Ternary Search Tries (22_42).srt | 25.74 KB |
| 6 - 6 - Maxflow Applications (22_20).srt | 25.52 KB |
| 11 - 1 - Introduction to Data Compression (22_27).srt | 25.48 KB |
| 5 - 5 - Negative Weights (21_01).srt | 23.88 KB |
| 3 - 5 - Strong Components (20_22).srt | 23.83 KB |
| 13 - 1 - Brewer's Problem (21_15).srt | 22.97 KB |
| 5 - 4 - Edge-Weighted DAGs (19_23).srt | 22.87 KB |
| 10 - 1 - Regular Expressions (20_03).srt | 22.83 KB |
| 5 - 3 - Dijkstra's Algorithm (18_58).srt | 22.51 KB |
| 7 - 6 - Suffix Arrays (19_25).srt | 22.50 KB |
| 2 - 5 - Connected Components (18_56).srt | 22.39 KB |
| 3 - 3 - Digraph Search (20_56).srt | 22.38 KB |
| 10 - 5 - Regular Expression Applications (20_09).srt | 21.62 KB |
| 8 - 3 - Character-Based Operations (20_03).srt | 21.59 KB |
| 7 - 1 - Strings in Java (17_43).srt | 21.35 KB |
| 14 - 1 - Introduction to Intractability (17_00).srt | 19.89 KB |
| 10 - 3 - NFA Simulation (18_27).srt | 19.82 KB |
| 14 - 3 - P vs. NP (16_29).srt | 18.07 KB |
| 13 - 3 - Simplex Implementations (16_21).srt | 17.93 KB |
| 7 - 3 - LSD Radix Sort (15_00).srt | 17.74 KB |
| 9 - 5 - Rabin-Karp (16_13).srt | 16.94 KB |
| 2 - 6 - Graph Challenges (14_29).srt | 16.89 KB |
| 2 - 2 - Graph API (14_47).srt | 16.47 KB |
| 6 - 5 - Java Implementation (14_29).srt | 16.21 KB |
| 5 - 2 - Shortest Path Properties (14_46).srt | 15.94 KB |
| 4 - 2 - Greedy Algorithm (12_56).srt | 15.87 KB |
| 7 - 4 - MSD Radix Sort (13_41).srt | 15.82 KB |
| 2 - 4 - Breadth-First Search (13_34).srt | 15.71 KB |
| 10 - 2 - REs and NFAs (13_14).srt | 15.29 KB |
| 3 - 4 - Topological Sort (12_54).srt | 14.64 KB |
| 14 - 4 - Classifying Problems (13_43).srt | 14.54 KB |
| 12 - 4 - Classifying Problems (12_45).srt | 14.04 KB |
| 14 - 6 - Coping with Intractability (14_01).srt | 14.02 KB |
| 4 - 4 - Kruskal's Algorithm (12_28).srt | 13.98 KB |
| 14 - 5 - NP-Completeness (12_38).srt | 13.88 KB |
| 13 - 4 - Linear Programming Reductions (11_46).srt | 13.21 KB |
| 5 - 1 - Shortest Paths APIs (10_51).srt | 13.15 KB |
| 6 - 1 - Introduction to Maxflow (10_33).srt | 12.99 KB |
| 7 - 2 - Key-Indexed Counting (12_06).srt | 12.97 KB |
| 1 - 1 - Course Introduction (9_22).srt | 12.82 KB |
| 14 - 2 - Search Problems (10_56).srt | 12.67 KB |
| 10 - 4 - NFA Construction (11_42).srt | 12.34 KB |
| 12 - 1 - Introduction to Reductions (9_25).srt | 11.84 KB |
| 4 - 3 - Edge-Weighted Graph API (11_15).srt | 11.83 KB |
| 13 - 2 - Simplex Algorithm (11_49).srt | 11.79 KB |
| 9 - 2 - Brute-Force Substring Search (10_11).srt | 11.73 KB |
| 4 - 6 - MST Context (10_34).srt | 11.56 KB |
| 2 - 1 - Introduction to Graphs (9_32).srt | 11.46 KB |
| 6 - 3 - Maxflow-Mincut Theorem (9_38).srt | 10.95 KB |
| 12 - 3 - Establishing Lower Bounds (9_16).srt | 10.56 KB |
| 3 - 1 - Introduction to Digraphs (8_30).srt | 10.30 KB |
| 6 - 4 - Running Time Analysis (8_49).srt | 9.89 KB |
| 9 - 4 - Boyer-Moore (8_36).srt | 9.71 KB |
| 12 - 2 - Designing Algorithms (8_13).srt | 9.46 KB |
| 7 - 5 - 3-way Radix Quicksort (7_22).srt | 8.23 KB |
| 9 - 1 - Introduction to Substring Search (6_42).srt | 7.69 KB |
| 6 - 2 - Ford-Fulkerson Algorithm (6_32).srt | 7.56 KB |
| 11 - 2 - Run-Length Coding (5_59).srt | 6.34 KB |
| _README.txt | 6.11 KB |
| 3 - 2 - Digraph API (4_56).srt | 5.27 KB |
| 4 - 1 - Introduction to MSTs (4_04).srt | 4.37 KB |
| udp://tracker.openbittorrent.com:80 |
| udp://tracker.publicbt.com:80 |
| udp://tracker.istole.it:6969 |
| udp://tracker.ccc.de:80 |
| udp://open.demonii.com:1337 |
TorrentBank
Copyright © 2024