| !Stanford/!Introduction to Human-Computer Interaction Design/FINAL PRESENTATIONS/CS147PresentationFall2010.flv |
446.5 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/MOBILE WEBAPP DEMOS/CS147Demos.flv |
399.8 MB |
| !Stanford/!Design and Analysis of Algorithms/20. The Wider World of Algorithms/CS161L20P3.flv |
124.5 MB |
| !Stanford/!Design and Analysis of Algorithms/10. Path Compression and Clustering/CS161L10P4.flv |
123.7 MB |
| !Stanford/!Design and Analysis of Algorithms/11. Introduction to Randomized Algorithms/CS161L11P3.flv |
120.2 MB |
| !Stanford/!Design and Analysis of Algorithms/9. Kruskal's Algorithm and Union-Find/CS161L9P5.flv |
120.1 MB |
| !Stanford/!Design and Analysis of Algorithms/19. Approximation Algorithms/CS161L19P6.flv |
118.9 MB |
| !Stanford/!Design and Analysis of Algorithms/7. Introduction to Greedy Algorithms/CS161L7P4.flv |
117.9 MB |
| !Stanford/!Design and Analysis of Algorithms/3. THE MASTER METHOD/CS161L3P6.flv |
117.7 MB |
| !Stanford/!Design and Analysis of Algorithms/11. Introduction to Randomized Algorithms/CS161L11P5.flv |
116.4 MB |
| !Stanford/!Design and Analysis of Algorithms/7. Introduction to Greedy Algorithms/CS161L7P6.flv |
116 MB |
| !Stanford/!Design and Analysis of Algorithms/9. Kruskal's Algorithm and Union-Find/CS161L9P7.flv |
115.5 MB |
| !Stanford/!Design and Analysis of Algorithms/15. Introduction to Dynamic Programming/CS161L15P6.flv |
115.2 MB |
| !Stanford/!Design and Analysis of Algorithms/3. THE MASTER METHOD/CS161L3P1.flv |
115 MB |
| !Stanford/!Design and Analysis of Algorithms/16. Sequence Alignment/CS161L16P8.flv |
114.8 MB |
| !Stanford/!Design and Analysis of Algorithms/17. Shortest Paths. Bellman-Ford and Floyd-Warshall/CS161L17P3.flv |
112.1 MB |
| !Stanford/!Design and Analysis of Algorithms/14. Balanced Search Trees and Skip Lists/CS161L14P4.flv |
109.9 MB |
| !Stanford/!Design and Analysis of Algorithms/4. LINEAR-TIME MEDIAN/CS161L4P3.flv |
109.1 MB |
| !Stanford/!Design and Analysis of Algorithms/6. CONNECTIVITY IN DIRECTED GRAPHS/CS161L6P10.flv |
107.7 MB |
| !Stanford/!Design and Analysis of Algorithms/14. Balanced Search Trees and Skip Lists/CS161L14P6.flv |
106 MB |
| !Stanford/!Design and Analysis of Algorithms/20. The Wider World of Algorithms/CS161L20P4.flv |
105.2 MB |
| !Stanford/!Design and Analysis of Algorithms/7. Introduction to Greedy Algorithms/CS161L7P5.flv |
104.7 MB |
| !Stanford/!Design and Analysis of Algorithms/19. Approximation Algorithms/CS161L19P5.flv |
102.5 MB |
| !Stanford/!Design and Analysis of Algorithms/14. Balanced Search Trees and Skip Lists/CS161L14P3.flv |
102.3 MB |
| !Stanford/!Design and Analysis of Algorithms/5. GRAPH SEARCH & DIJKSTRA's ALGORITHM/CS161L5P8.flv |
100.7 MB |
| !Stanford/!Design and Analysis of Algorithms/4. LINEAR-TIME MEDIAN/CS161L4P7.flv |
99.9 MB |
| !Stanford/!Design and Analysis of Algorithms/15. Introduction to Dynamic Programming/CS161L15P2.flv |
99.5 MB |
| !Stanford/!Design and Analysis of Algorithms/10. Path Compression and Clustering/CS161L10P1.flv |
98.5 MB |
| !Stanford/!Design and Analysis of Algorithms/16. Sequence Alignment/CS161L16P2.flv |
97.3 MB |
| !Stanford/!Design and Analysis of Algorithms/12. QuickSort/CS161L12P4.flv |
97.1 MB |
| !Stanford/!Design and Analysis of Algorithms/17. Shortest Paths. Bellman-Ford and Floyd-Warshall/CS161L17P2.flv |
96.4 MB |
| !Stanford/!Design and Analysis of Algorithms/4. LINEAR-TIME MEDIAN/CS161L4P8.flv |
95.8 MB |
| !Stanford/!Design and Analysis of Algorithms/19. Approximation Algorithms/CS161L19P2.flv |
94.5 MB |
| !Stanford/!Design and Analysis of Algorithms/10. Path Compression and Clustering/CS161L10P3.flv |
94.4 MB |
| !Stanford/!Design and Analysis of Algorithms/15. Introduction to Dynamic Programming/CS161L15P7.flv |
93.3 MB |
| !Stanford/!Design and Analysis of Algorithms/15. Introduction to Dynamic Programming/CS161L15P5.flv |
92 MB |
| !Stanford/!Design and Analysis of Algorithms/7. Introduction to Greedy Algorithms/CS161L7P2.flv |
91.3 MB |
| !Stanford/!Design and Analysis of Algorithms/11. Introduction to Randomized Algorithms/CS161L11P4.flv |
91.3 MB |
| !Stanford/!Design and Analysis of Algorithms/6. CONNECTIVITY IN DIRECTED GRAPHS/CS161L6P4.flv |
91 MB |
| !Stanford/!Design and Analysis of Algorithms/12. QuickSort/CS161L12P9.flv |
90.5 MB |
| !Stanford/!Design and Analysis of Algorithms/10. Path Compression and Clustering/CS161L10P2.flv |
90.4 MB |
| !Stanford/!Design and Analysis of Algorithms/8. Minimum Spanning Trees/CS161L8P9.flv |
90.3 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/III. USER-CENTERED DESIGN/CS147L3P1.flv |
90.1 MB |
| !Stanford/!Design and Analysis of Algorithms/9. Kruskal's Algorithm and Union-Find/CS161L9P3.flv |
89.2 MB |
| !Stanford/!Design and Analysis of Algorithms/5. GRAPH SEARCH & DIJKSTRA's ALGORITHM/CS161L5P3.flv |
88.9 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/XI. CONDUCTING USER STUDY/CS147L14P4-af.flv |
88.5 MB |
| !Stanford/!Design and Analysis of Algorithms/3. THE MASTER METHOD/CS161L3P4b.flv |
88.4 MB |
| !Stanford/!Design and Analysis of Algorithms/19. Approximation Algorithms/CS161L19P4.flv |
88 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/X. EVALUATING DESIGNS/CS147L17P1-af.flv |
87 MB |
| !Stanford/!Design and Analysis of Algorithms/15. Introduction to Dynamic Programming/CS161L15P3.flv |
86.7 MB |
| !Stanford/!Design and Analysis of Algorithms/20. The Wider World of Algorithms/CS161L20P1.flv |
86.6 MB |
| !Stanford/!Design and Analysis of Algorithms/16. Sequence Alignment/CS161L16P4.flv |
86.3 MB |
| !Stanford/!Design and Analysis of Algorithms/14. Balanced Search Trees and Skip Lists/CS161L14P7.flv |
85.8 MB |
| !Stanford/!Design and Analysis of Algorithms/15. Introduction to Dynamic Programming/CS161L15P4.flv |
85.4 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/II. DISCOVERY/CS147L2P2.flv |
85.4 MB |
| !Stanford/!Design and Analysis of Algorithms/17. Shortest Paths. Bellman-Ford and Floyd-Warshall/CS161L17P4.flv |
85.2 MB |
| !Stanford/!Design and Analysis of Algorithms/16. Sequence Alignment/CS161L16P7.flv |
84.9 MB |
| !Stanford/!Design and Analysis of Algorithms/8. Minimum Spanning Trees/CS161L8P5.flv |
84.2 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/XI. CONDUCTING USER STUDY/CS147L14P2-af.flv |
84.2 MB |
| !Stanford/!Design and Analysis of Algorithms/2. BASIC DIVIDE & CONQUER/CS161L2P5.flv |
84.1 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/III. USER-CENTERED DESIGN/CS147L3P4.flv |
83.8 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/XI. CONDUCTING USER STUDY/CS147L14P1-af.flv |
83.4 MB |
| !Stanford/!Design and Analysis of Algorithms/13. Hashing/CS161L13P4.flv |
83 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/IV. PROTOTYPING/CS147L4P4.flv |
83 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/IV. PROTOTYPING/CS147L4P1.flv |
82.9 MB |
| !Stanford/!Design and Analysis of Algorithms/20. The Wider World of Algorithms/CS161L20P5.flv |
82 MB |
| !Stanford/!Design and Analysis of Algorithms/18. NP-Complete Problems/CS161L18P4.flv |
81.9 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/IX. INFORMATION DESIGN/CS147L10P1-af.flv |
81.7 MB |
| !Stanford/!Design and Analysis of Algorithms/7. Introduction to Greedy Algorithms/CS161L7P1.flv |
81.6 MB |
| !Stanford/!Design and Analysis of Algorithms/11. Introduction to Randomized Algorithms/CS161L11P2.flv |
81.5 MB |
| !Stanford/!Design and Analysis of Algorithms/17. Shortest Paths. Bellman-Ford and Floyd-Warshall/CS161L17P1.flv |
81.4 MB |
| !Stanford/!Design and Analysis of Algorithms/18. NP-Complete Problems/CS161L18P5.flv |
81.3 MB |
| !Stanford/!Design and Analysis of Algorithms/13. Hashing/CS161L13P6.flv |
80.8 MB |
| !Stanford/!Design and Analysis of Algorithms/14. Balanced Search Trees and Skip Lists/CS161L14P8.flv |
80.6 MB |
| !Stanford/!Design and Analysis of Algorithms/5. GRAPH SEARCH & DIJKSTRA's ALGORITHM/CS161L5P2.flv |
80 MB |
| !Stanford/!Design and Analysis of Algorithms/4. LINEAR-TIME MEDIAN/CS161L4P10.flv |
79.8 MB |
| !Stanford/!Design and Analysis of Algorithms/13. Hashing/CS161L13P7.flv |
79.7 MB |
| !Stanford/!Design and Analysis of Algorithms/13. Hashing/CS161L13P3.flv |
79.6 MB |
| !Stanford/!Design and Analysis of Algorithms/9. Kruskal's Algorithm and Union-Find/CS161L9P9.flv |
79.4 MB |
| !Stanford/!Design and Analysis of Algorithms/3. THE MASTER METHOD/CS161L3P2b.flv |
79.4 MB |
| !Stanford/!Design and Analysis of Algorithms/6. CONNECTIVITY IN DIRECTED GRAPHS/CS161L6P5.flv |
79.3 MB |
| !Stanford/!Design and Analysis of Algorithms/17. Shortest Paths. Bellman-Ford and Floyd-Warshall/CS161L17P6.flv |
79 MB |
| !Stanford/!Design and Analysis of Algorithms/19. Approximation Algorithms/CS161L19P3.flv |
78.7 MB |
| !Stanford/!Design and Analysis of Algorithms/5. GRAPH SEARCH & DIJKSTRA's ALGORITHM/CS161L5P9.flv |
78.2 MB |
| !Stanford/!Design and Analysis of Algorithms/18. NP-Complete Problems/CS161L18P10.flv |
78 MB |
| !Stanford/!Design and Analysis of Algorithms/2. BASIC DIVIDE & CONQUER/CS161L2P6.flv |
77.8 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/X. EVALUATING DESIGNS/CS147L13P2-af.flv |
77.5 MB |
| !Stanford/!Design and Analysis of Algorithms/15. Introduction to Dynamic Programming/CS161L15P1.flv |
77.1 MB |
| !Stanford/!Design and Analysis of Algorithms/3. THE MASTER METHOD/CS161L3P5.flv |
77.1 MB |
| !Stanford/!Design and Analysis of Algorithms/2. BASIC DIVIDE & CONQUER/CS161L2P8.flv |
76 MB |
| !Stanford/!Design and Analysis of Algorithms/1. INTRODUCTION/CS161L1P8.flv |
75.2 MB |
| !Stanford/!Design and Analysis of Algorithms/13. Hashing/CS161L13P8.flv |
74.2 MB |
| !Stanford/!Design and Analysis of Algorithms/18. NP-Complete Problems/CS161L18P1.flv |
74 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/II. DISCOVERY/CS147L2P1.flv |
73.6 MB |
| !Stanford/!Design and Analysis of Algorithms/2. BASIC DIVIDE & CONQUER/CS161L2P2.flv |
73.6 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/VIII. VISUAL DESIGN/CS147L9P3-af.flv |
73.5 MB |
| !Stanford/!Design and Analysis of Algorithms/1. INTRODUCTION/CS161L1P1.flv |
73.4 MB |
| !Stanford/!Design and Analysis of Algorithms/5. GRAPH SEARCH & DIJKSTRA's ALGORITHM/CS161L5P6.flv |
72.8 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/VI. DIRECT MANIPULATION/CS147L7P1-af.flv |
72.8 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/XII. COLLABORATION ON THE WEB/CS147L16P1-af.flv |
72.4 MB |
| !Stanford/!Design and Analysis of Algorithms/13. Hashing/CS161L13P9.flv |
72.3 MB |
| !Stanford/!Design and Analysis of Algorithms/6. CONNECTIVITY IN DIRECTED GRAPHS/CS161L6P7.flv |
72.2 MB |
| !Stanford/!Design and Analysis of Algorithms/8. Minimum Spanning Trees/CS161L8P3.flv |
71.6 MB |
| !Stanford/!Design and Analysis of Algorithms/6. CONNECTIVITY IN DIRECTED GRAPHS/CS161L6P8.flv |
71.4 MB |
| !Stanford/!Design and Analysis of Algorithms/10. Path Compression and Clustering/CS161L10P7.flv |
71.1 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/VI. DIRECT MANIPULATION/CS147L7P2-af.flv |
70.8 MB |
| !Stanford/!Design and Analysis of Algorithms/17. Shortest Paths. Bellman-Ford and Floyd-Warshall/CS161L17P5.flv |
70.6 MB |
| !Stanford/!Design and Analysis of Algorithms/8. Minimum Spanning Trees/CS161L8P6.flv |
70.4 MB |
| !Stanford/!Design and Analysis of Algorithms/20. The Wider World of Algorithms/CS161L20P6.flv |
70.1 MB |
| !Stanford/!Design and Analysis of Algorithms/1. INTRODUCTION/CS161L1P6.flv |
70.1 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/I. INTRODUCTION/CS147L1P1.flv |
69.5 MB |
| !Stanford/!Design and Analysis of Algorithms/5. GRAPH SEARCH & DIJKSTRA's ALGORITHM/CS161L5P5.flv |
69.1 MB |
| !Stanford/!Design and Analysis of Algorithms/16. Sequence Alignment/CS161L16P6.flv |
68.7 MB |
| !Stanford/!Design and Analysis of Algorithms/12. QuickSort/CS161L12P7.flv |
68.6 MB |
| !Stanford/!Design and Analysis of Algorithms/17. Shortest Paths. Bellman-Ford and Floyd-Warshall/CS161L17P7.flv |
68.4 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/X. EVALUATING DESIGNS/CS147L13P3-af.flv |
67.9 MB |
| !Stanford/!Design and Analysis of Algorithms/16. Sequence Alignment/CS161L16P5.flv |
67.5 MB |
| !Stanford/!Design and Analysis of Algorithms/13. Hashing/CS161L13P1.flv |
67.5 MB |
| !Stanford/!Design and Analysis of Algorithms/1. INTRODUCTION/CS161L1P5.flv |
66.8 MB |
| !Stanford/!Design and Analysis of Algorithms/10. Path Compression and Clustering/CS161L10P5.flv |
66.5 MB |
| !Stanford/!Design and Analysis of Algorithms/6. CONNECTIVITY IN DIRECTED GRAPHS/CS161L6P9.flv |
66.5 MB |
| !Stanford/!Design and Analysis of Algorithms/1. INTRODUCTION/CS161L1P3.flv |
65.7 MB |
| !Stanford/!Design and Analysis of Algorithms/18. NP-Complete Problems/CS161L18P8.flv |
64.8 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/VIII. VISUAL DESIGN/CS147L9P2-af.flv |
64.4 MB |
| !Stanford/!Design and Analysis of Algorithms/4. LINEAR-TIME MEDIAN/CS161L4P5.flv |
64.2 MB |
| !Stanford/!Design and Analysis of Algorithms/16. Sequence Alignment/CS161L16P1.flv |
64.1 MB |
| !Stanford/!Design and Analysis of Algorithms/13. Hashing/CS161L13P5.flv |
63.8 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/X. EVALUATING DESIGNS/CS147L13P1-af.flv |
63.8 MB |
| !Stanford/!Design and Analysis of Algorithms/1. INTRODUCTION/CS161L1P4.flv |
63.7 MB |
| !Stanford/!Design and Analysis of Algorithms/13. Hashing/CS161L13P2.flv |
62.7 MB |
| !Stanford/!Design and Analysis of Algorithms/16. Sequence Alignment/CS161L16P3.flv |
61.9 MB |
| !Stanford/!Design and Analysis of Algorithms/14. Balanced Search Trees and Skip Lists/CS161L14P1.flv |
61.6 MB |
| !Stanford/!Design and Analysis of Algorithms/12. QuickSort/CS161L12P6.flv |
61.5 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/XII. COLLABORATION ON THE WEB/CS147L16P2-af.flv |
60.9 MB |
| !Stanford/!Design and Analysis of Algorithms/1. INTRODUCTION/CS161L1P2.flv |
60.7 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/XI. CONDUCTING USER STUDY/CS147L14P3-af.flv |
60.4 MB |
| !Stanford/!Design and Analysis of Algorithms/9. Kruskal's Algorithm and Union-Find/CS161L9P6.flv |
60.1 MB |
| !Stanford/!Design and Analysis of Algorithms/19. Approximation Algorithms/CS161L19P1.flv |
59.8 MB |
| !Stanford/!Design and Analysis of Algorithms/2. BASIC DIVIDE & CONQUER/CS161L2P10.flv |
59.6 MB |
| !Stanford/!Design and Analysis of Algorithms/4. LINEAR-TIME MEDIAN/CS161L4P4.flv |
59.3 MB |
| !Stanford/!Design and Analysis of Algorithms/5. GRAPH SEARCH & DIJKSTRA's ALGORITHM/CS161L5P1.flv |
59.2 MB |
| !Stanford/!Design and Analysis of Algorithms/18. NP-Complete Problems/CS161L18P2.flv |
59.2 MB |
| !Stanford/!Design and Analysis of Algorithms/9. Kruskal's Algorithm and Union-Find/CS161L9P10.flv |
58.9 MB |
| !Stanford/!Design and Analysis of Algorithms/2. BASIC DIVIDE & CONQUER/CS161L2P9.flv |
58.6 MB |
| !Stanford/!Design and Analysis of Algorithms/8. Minimum Spanning Trees/CS161L8P7.flv |
58.4 MB |
| !Stanford/!Design and Analysis of Algorithms/18. NP-Complete Problems/CS161L18P7.flv |
58.3 MB |
| !Stanford/!Design and Analysis of Algorithms/3. THE MASTER METHOD/CS161L3P2.flv |
57.8 MB |
| !Stanford/!Design and Analysis of Algorithms/1. INTRODUCTION/CS161L1P7.flv |
57.2 MB |
| !Stanford/!Design and Analysis of Algorithms/11. Introduction to Randomized Algorithms/CS161L11P6.flv |
57.2 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/III. USER-CENTERED DESIGN/CS147L3P2.flv |
57.1 MB |
| !Stanford/!Design and Analysis of Algorithms/3. THE MASTER METHOD/CS161L3P3.flv |
57 MB |
| !Stanford/!Design and Analysis of Algorithms/18. NP-Complete Problems/CS161L18P9.flv |
57 MB |
| !Stanford/!Design and Analysis of Algorithms/10. Path Compression and Clustering/CS161L10P8.flv |
56.3 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/VII. REPRESENTATION MATTERS/CS147L8P2-af.flv |
56.1 MB |
| !Stanford/!Design and Analysis of Algorithms/10. Path Compression and Clustering/CS161L10P6.flv |
56 MB |
| !Stanford/!Design and Analysis of Algorithms/8. Minimum Spanning Trees/CS161L8P4.flv |
56 MB |
| !Stanford/!Design and Analysis of Algorithms/7. Introduction to Greedy Algorithms/CS161L7P3.flv |
55.9 MB |
| !Stanford/!Design and Analysis of Algorithms/6. CONNECTIVITY IN DIRECTED GRAPHS/CS161L6P1.flv |
55.9 MB |
| !Stanford/!Design and Analysis of Algorithms/12. QuickSort/CS161L12P8.flv |
55.8 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/XII. COLLABORATION ON THE WEB/CS147L16P4-af.flv |
55.4 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/VII. REPRESENTATION MATTERS/CS147L8P3-af.flv |
55.3 MB |
| !Stanford/!Design and Analysis of Algorithms/5. GRAPH SEARCH & DIJKSTRA's ALGORITHM/CS161L5P4.flv |
55.1 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/XII. COLLABORATION ON THE WEB/CS147L16P3-af.flv |
54.6 MB |
| !Stanford/!Design and Analysis of Algorithms/9. Kruskal's Algorithm and Union-Find/CS161L9P1.flv |
53.3 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/II. DISCOVERY/CS147L2P3.flv |
52.7 MB |
| !Stanford/!Design and Analysis of Algorithms/4. LINEAR-TIME MEDIAN/CS161L4P2.flv |
52.2 MB |
| !Stanford/!Design and Analysis of Algorithms/12. QuickSort/CS161L12P2.flv |
52 MB |
| !Stanford/!Design and Analysis of Algorithms/14. Balanced Search Trees and Skip Lists/CS161L14P2.flv |
51.8 MB |
| !Stanford/!Design and Analysis of Algorithms/3. THE MASTER METHOD/CS161L3P4.flv |
51.8 MB |
| !Stanford/!Design and Analysis of Algorithms/11. Introduction to Randomized Algorithms/CS161L11P1.flv |
51 MB |
| !Stanford/!Design and Analysis of Algorithms/20. The Wider World of Algorithms/CS161L20P2.flv |
50.9 MB |
| !Stanford/!Design and Analysis of Algorithms/8. Minimum Spanning Trees/CS161L8P10.flv |
50.7 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/I. INTRODUCTION/CS147L1P2.flv |
49.8 MB |
| !Stanford/!Design and Analysis of Algorithms/2. BASIC DIVIDE & CONQUER/CS161L2P7.flv |
48.3 MB |
| !Stanford/!Design and Analysis of Algorithms/18. NP-Complete Problems/CS161L18P3.flv |
48.2 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/IX. INFORMATION DESIGN/CS147L10P2-af.flv |
48.1 MB |
| !Stanford/!Design and Analysis of Algorithms/2. BASIC DIVIDE & CONQUER/CS161L2P11.flv |
47.7 MB |
| !Stanford/!Introduction to databases/screenside/Introduction to Databases Screenside Chat #3.flv |
47.5 MB |
| !Stanford/!Introduction to databases/screenside/Introduction to Databases Screenside Chat #2.flv |
47.4 MB |
| !Stanford/!Design and Analysis of Algorithms/12. QuickSort/CS161L12P1.flv |
45.8 MB |
| !Stanford/!Design and Analysis of Algorithms/6. CONNECTIVITY IN DIRECTED GRAPHS/CS161L6P3.flv |
44.6 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/VIII. VISUAL DESIGN/CS147L9P1-af.flv |
44.6 MB |
| !Stanford/!Design and Analysis of Algorithms/8. Minimum Spanning Trees/CS161L8P11.flv |
44.4 MB |
| !Stanford/!Design and Analysis of Algorithms/18. NP-Complete Problems/CS161L18P6.flv |
44 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/VI. DIRECT MANIPULATION/CS147L7P3-af.flv |
44 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/VII. REPRESENTATION MATTERS/CS147L8P1-af.flv |
43.7 MB |
| !Stanford/!Design and Analysis of Algorithms/9. Kruskal's Algorithm and Union-Find/CS161L9P2.flv |
43.4 MB |
| !Stanford/!Introduction to databases/screenside/Introduction to Databases Screenside Chat #1.flv |
43.2 MB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/Algorithm Design.pdf |
42.9 MB |
| !Stanford/!Design and Analysis of Algorithms/12. QuickSort/CS161L12P3.flv |
41.6 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/XII. COLLABORATION ON THE WEB/CS147L16P5-af.flv |
40.4 MB |
| !Stanford/!Introduction to databases/screenside/Introduction to Databases Screenside Chat #4.flv |
40.3 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/III. USER-CENTERED DESIGN/CS147L3P3.flv |
40.2 MB |
| !Stanford/!Design and Analysis of Algorithms/1. INTRODUCTION/CS161L1P9.flv |
39.8 MB |
| !Stanford/!Design and Analysis of Algorithms/5. GRAPH SEARCH & DIJKSTRA's ALGORITHM/CS161L5P7.flv |
39 MB |
| !Stanford/!Design and Analysis of Algorithms/4. LINEAR-TIME MEDIAN/CS161L4P1.flv |
38.7 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/IV. PROTOTYPING/CS147L4P2.flv |
38.4 MB |
| !Stanford/!Introduction to databases/11-03-view-modifications-using-triggers.mp4 |
38 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/V. HEURISTIC EVALUATION/CS147L6P2.flv |
37.8 MB |
| !Stanford/!Design and Analysis of Algorithms/20. The Wider World of Algorithms/CS161L20P9.flv |
37.7 MB |
| !Stanford/!Design and Analysis of Algorithms/9. Kruskal's Algorithm and Union-Find/CS161L9P4.flv |
37.4 MB |
| !Stanford/!Design and Analysis of Algorithms/2. BASIC DIVIDE & CONQUER/CS161L2P4.flv |
36.6 MB |
| !Stanford/!Design and Analysis of Algorithms/8. Minimum Spanning Trees/CS161L8P1.flv |
36.4 MB |
| !Stanford/!Design and Analysis of Algorithms/8. Minimum Spanning Trees/CS161L8P8.flv |
36.2 MB |
| !Stanford/!Design and Analysis of Algorithms/2. BASIC DIVIDE & CONQUER/CS161L2P3.flv |
36.2 MB |
| !Stanford/!Design and Analysis of Algorithms/14. Balanced Search Trees and Skip Lists/CS161L14P5.flv |
36 MB |
| !Stanford/!Design and Analysis of Algorithms/8. Minimum Spanning Trees/CS161L8P2.flv |
36 MB |
| !Stanford/!Design and Analysis of Algorithms/19. Approximation Algorithms/CS161L19P7.flv |
35.7 MB |
| !Stanford/!Design and Analysis of Algorithms/6. CONNECTIVITY IN DIRECTED GRAPHS/CS161L6P2.flv |
34.9 MB |
| !Stanford/!Introduction to databases/09-05-triggers-demo-part-1.mp4 |
34.7 MB |
| !Stanford/!Introduction to databases/15-02-olap-demo.mp4 |
33.8 MB |
| !Stanford/!Design and Analysis of Algorithms/4. LINEAR-TIME MEDIAN/CS161L4P9.flv |
33.6 MB |
| !Stanford/!Introduction to databases/14-02-basic-recursive-with-statement-demo.mp4 |
33.6 MB |
| !Stanford/!Design and Analysis of Algorithms/6. CONNECTIVITY IN DIRECTED GRAPHS/CS161L6P6.flv |
33.3 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/IX. INFORMATION DESIGN/CS147L10P4-af.flv |
32.9 MB |
| !Stanford/!Introduction to databases/screenside/Introduction to Databases Screenside Chat #7.flv |
32.6 MB |
| !Stanford/!Introduction to databases/06-05-xslt.mp4 |
31.5 MB |
| !Stanford/!Design and Analysis of Algorithms/2. BASIC DIVIDE & CONQUER/CS161L2P1.flv |
31.3 MB |
| !Stanford/!Design and Analysis of Algorithms/12. QuickSort/CS161L12P5.flv |
31 MB |
| !Stanford/!Introduction to databases/04-06-aggregation.mp4 |
30.3 MB |
| !Stanford/!Introduction to databases/07-02-functional-dependencies.mp4 |
30.2 MB |
| !Stanford/!Introduction to databases/08-02-uml-to-relations.mp4 |
30.2 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/V. HEURISTIC EVALUATION/CS147L6P1.flv |
30 MB |
| !Stanford/!Design and Analysis of Algorithms/20. The Wider World of Algorithms/CS161L20P7.flv |
29.2 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/IX. INFORMATION DESIGN/CS147L10P3-af.flv |
28.4 MB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/Introduction_to_Algorithms_Supplemental_Content_-_The_MIT_Pr.flv |
28.2 MB |
| !Stanford/!Introduction to databases/09-02-constraints.mp4 |
27.9 MB |
| !Stanford/!Introduction to databases/06-02-xpath-demo.mp4 |
27.8 MB |
| !Stanford/!Design and Analysis of Algorithms/20. The Wider World of Algorithms/CS161L20P8.flv |
27.8 MB |
| !Stanford/!Introduction to databases/screenside/Introduction to Databases Screenside Chat #5.flv |
27.2 MB |
| !Stanford/!Introduction to databases/11-04-automatic-view-modifications.mp4 |
26.2 MB |
| !Stanford/!Introduction to databases/08-01-uml-data-modeling.mp4 |
26.2 MB |
| !Stanford/!Introduction to databases/07-03-bcnf.mp4 |
24.6 MB |
| !Stanford/!Introduction to databases/07-04-multivalued-dependencies.mp4 |
24.6 MB |
| !Stanford/!Introduction to databases/04-04-subqueries-in-where.mp4 |
23.6 MB |
| !Stanford/!Introduction to databases/screenside/Introduction to Databases Screenside Chat #8.flv |
23.2 MB |
| !Stanford/!Design and Analysis of Algorithms/9. Kruskal's Algorithm and Union-Find/CS161L9P8.flv |
22.6 MB |
| !Stanford/!Cryptography/Message Integrity/5 - 3 - CBC-MAC and NMAC (20 min).mp4 |
22.3 MB |
| !Stanford/!Introduction to Human-Computer Interaction Design/IV. PROTOTYPING/CS147L4P3.flv |
22.2 MB |
| !Stanford/!Game Theory/2 - 2 - Normal Form Definitions Reshoot (16_54).mp4 |
22 MB |
| !Stanford/!Introduction to databases/14-03-nonlinear-mutual-recursion.mp4 |
21.9 MB |
| !Stanford/!Design and Analysis of Algorithms/4. LINEAR-TIME MEDIAN/CS161L4P6.flv |
21.4 MB |
| !Stanford/!Introduction to databases/09-03-referential-integrity.mp4 |
21.2 MB |
| !Stanford/!Introduction to databases/06-04-xquery-demo.mp4 |
20.7 MB |
| !Stanford/!Introduction to databases/03-01-relational-algebra-1.mp4 |
20.6 MB |
| !Stanford/!Introduction to databases/03-02-relational-algebra-2.mp4 |
19.7 MB |
| !Stanford/!Introduction to databases/12-03-isolation-levels.mp4 |
19.5 MB |
| !Stanford/!Introduction to databases/screenside/Introduction to Databases Screenside Chat #6.flv |
19.2 MB |
| !Stanford/!Introduction to databases/15-01-olap.mp4 |
18.8 MB |
| !Stanford/!Game Theory/2 - 1 - Predator Prey Example (14_47).mp4 |
18.7 MB |
| !Stanford/!Introduction to databases/07-01-relational-design-overview.mp4 |
18 MB |
| !Stanford/!Introduction to databases/05-02-dtds-ids-idrefs.mp4 |
17.9 MB |
| !Stanford/!Game Theory/3 - 8 - Best Response, Multiple Equilibrium Revisited (14_48).mp4 |
17.6 MB |
| !Stanford/!Introduction to databases/04-08-data-modification-statements.mp4 |
17.4 MB |
| !Stanford/!Cryptography/Stream Ciphers/PRG_Security_Definitions_2.5.mp4 |
17.1 MB |
| !Stanford/!Introduction to databases/11-05-materialized-views.mp4 |
17.1 MB |
| !Stanford/!Cryptography/Message Integrity/5 - 5 - PMAC and the Carter-Wegman MAC (16 min).mp4 |
17.1 MB |
| !Stanford/!Game Theory/3 - 4 - Mixed Strategies (13_24).mp4 |
16.9 MB |
| !Stanford/!Cryptography/Block Ciphers/recoded_videos_[6fc0f052] 3.2_25Jan.mp4 |
16.9 MB |
| !Stanford/!Cryptography/Message Integrity/5 - 1 - Message Authentication Codes (16 min).mp4 |
16.6 MB |
| !Stanford/!Introduction to databases/11-01-defining-using-views.mp4 |
16.4 MB |
| !Stanford/!Cryptography/Stream Ciphers/Attacks_on_stream_ciphers_and_the_one_time_pad_2.3.mp4 |
16.3 MB |
| !Stanford/!Cryptography/Collision Resistance/6 - 2 - Generic birthday attack (16 min).mp4 |
16.1 MB |
| !Stanford/!Introduction to databases/09-04-triggers-intro.mp4 |
16.1 MB |
| !Stanford/!Introduction to databases/05-03-xml-schema.mp4 |
15.5 MB |
| !Stanford/!Introduction to databases/12-01-transactions-intro.mp4 |
15.2 MB |
| !Stanford/!Game Theory/2 - 3 - Normal Form Definitions (12_09).mp4 |
15.1 MB |
| !Stanford/!Game Theory/3 - 6 - Minimax Theorem (11_20).mp4 |
14.8 MB |
| !Stanford/!Cryptography/Block Ciphers/recoded_videos_[7a5600a5] 3.3.mp4 |
14.7 MB |
| !Stanford/!Cryptography/Stream Ciphers/Real-world_stream_ciphers_2.4.mp4 |
14.6 MB |
| !Stanford/!Introduction to databases/10-01-indexes.mp4 |
14.1 MB |
| !Stanford/!Cryptography/Using Block Ciphers/recoded_videos_[ddb8cadf] 4.3.mp4 |
13.9 MB |
| !Stanford/!Introduction to databases/12-02-transactions-properties.mp4 |
13.9 MB |
| !Stanford/!Introduction to databases/09-06-triggers-demo-part-2.mp4 |
13.9 MB |
| !Stanford/!Introduction to databases/05-01-well-formed-xml.mp4 |
13.8 MB |
| !Stanford/!Game Theory/3 - 3 - Tragedy of the Commons (11_20).mp4 |
13.8 MB |
| !Stanford/!Cryptography/Stream Ciphers/Stream_ciphers_and_pseudo_random_generators_02.2-stream-cipherExpt.mp4 |
13.6 MB |
| !Stanford/!Introduction to databases/09-01-motivation-overview.mp4 |
13.6 MB |
| !Stanford/!Game Theory/3 - 7 - Comparative Statics (10_50).mp4 |
13.3 MB |
| !Stanford/!Game Theory/3 - 5 - Pure and Mixed Equilibrium (10_12).mp4 |
13.3 MB |
| !Stanford/!Introduction to databases/07-05-shortcomings-bcnf-4nf.mp4 |
13.2 MB |
| !Stanford/!Cryptography/Introduction/History_of_cryptography_01.3-history-jan3.mp4 |
13.1 MB |
| !Stanford/!Discrete Probability/01.4-ProbabilityMassFunction-BinomialDistribution.mp4 |
13.1 MB |
| !Stanford/!Game Theory/2 - 6 - Nash Equilibrium - Examples (10_33).mp4 |
12.9 MB |
| !Stanford/!Cryptography/Block Ciphers/recoded_videos_[94a40d14] 3.1New.mp4 |
12.7 MB |
| !Stanford/!Cryptography/Collision Resistance/6 - 3 - The Merkle-Damgard Paradigm (12 min).mp4 |
12.6 MB |
| !Stanford/!Cryptography/Stream Ciphers/Information_theoretic_security_and_the_one_time_pad_02.1-otp-jan4-new.mp4 |
12.6 MB |
| !Stanford/!Game Theory/3 - 9 - Existence of Nash Equilibrium (9_50).mp4 |
12.3 MB |
| !Stanford/!Discrete Probability/01.5-ProbabilityMassFunction-ProblemSession.mp4 |
12.1 MB |
| !Stanford/!Cryptography/Collision Resistance/6 - 1 - Introduction (11 min).mp4 |
11.9 MB |
| !Stanford/!Cryptography/Introduction/Discrete_probability_1.4.mp4 |
11.9 MB |
| !Stanford/!Introduction to databases/04-02-basic-select-statement.mp4 |
11.9 MB |
| !Stanford/!Introduction to databases/14-01-basic-recursive-with-statement.mp4 |
11.9 MB |
| !Stanford/!Introduction to databases/13-01-authorization.mp4 |
11.7 MB |
| !Stanford/!Cryptography/Block Ciphers/recoded_videos_[bff99254] 3.4.mp4 |
11.6 MB |
| !Stanford/!Game Theory/1 - 1 - Introduction and Logistics (8_19).mp4 |
11.5 MB |
| !Stanford/!Game Theory/3 - 1 - Nash Equilibrium with Many Players (9_42).mp4 |
11.3 MB |
| !Stanford/!Game Theory/3 - 2 - Braess's Paradox (9_09).mp4 |
11.2 MB |
| !Stanford/!Cryptography/Message Integrity/5 - 2 - MACs Based On PRFs (10 min).mp4 |
11.2 MB |
| !Stanford/!Introduction to databases/01-01-introduction.mp4 |
11.1 MB |
| !Stanford/!Cryptography/Introduction/What_is_cryptography_1.2Final.mp4 |
11 MB |
| !Stanford/!Game Theory/2 - 4 - Dominance (8_48).mp4 |
11 MB |
| !Stanford/!Cryptography/Stream Ciphers/Semantic_Security_2.6New.mp4 |
10.7 MB |
| !Stanford/!Introduction to databases/06-01-xpath-intro.mp4 |
10.6 MB |
| !Stanford/!Game Theory/2 - 5 - Nash Equilibrium - Pure Strategy Definitions (8_24).mp4 |
10.6 MB |
| !Stanford/!Introduction to databases/04-03-table-variables-set-operators.mp4 |
10.3 MB |
| !Stanford/!Cryptography/Using Block Ciphers/recoded_videos_[8a65cc65] 4.4New.mp4 |
10.2 MB |
| !Stanford/!Discrete Probability/01.2-ProbabilityMassFunction-UniformDistribution.mp4 |
9.9 MB |
| !Stanford/!Discrete Probability/01.3-ProbabilityMassFunction-BernoulliDistribution.mp4 |
9.8 MB |
| !Stanford/!Introduction to databases/04-05-subqueries-in-from-select.mp4 |
9.6 MB |
| !Stanford/!Discrete Probability/01.1-ProbabilityMassFunction-Introduction.mp4 |
9.5 MB |
| !Stanford/!Cryptography/Collision Resistance/6 - 6 - Timing attacks on MAC verification (9 min).mp4 |
9.4 MB |
| !Stanford/!Introduction to databases/11-02-view-modifications-intro.mp4 |
9.4 MB |
| !Stanford/!Cryptography/Message Integrity/5 - 4 - MAC padding (9 min).mp4 |
9.3 MB |
| !Stanford/!Cryptography/Introduction_to_Cryptography.flv |
9.1 MB |
| !Stanford/!Introduction to databases/02-02-querying-relational-databases.mp4 |
9.1 MB |
| !Stanford/!Cryptography/Block Ciphers/recoded_videos_[84b1a9ae] 3.6.mp4 |
9 MB |
| !Stanford/!Cryptography/Collision Resistance/6 - 4 - Constructing compression functions (8 min).mp4 |
8.8 MB |
| !Stanford/!Cryptography/Using Block Ciphers/recoded_videos_[f85e8ab1] 4.1.mp4 |
8.7 MB |
| !Stanford/!Cryptography/Introduction/Course_Overview_1.1.mp4 |
8.3 MB |
| !Stanford/!Introduction to databases/02-01-relational-model.mp4 |
8.1 MB |
| !Stanford/!Cryptography/Block Ciphers/recoded_videos_[c2dbcf40] 3.5New.mp4 |
8.1 MB |
| !Stanford/!Cryptography/Collision Resistance/6 - 5 - HMAC - a mac from SHA256 (7 min).mp4 |
7.8 MB |
| !Stanford/!Cryptography/Stream Ciphers/Stream_ciphers_are_semantically_secure_2.7.mp4 |
7.7 MB |
| !Stanford/!Introduction to databases/04-07-null-values.mp4 |
7.5 MB |
| !Stanford/!Cryptography/Using Block Ciphers/recoded_videos_[1fe804c0] 4.5.mp4 |
7.5 MB |
| !Stanford/!Cryptography/Stream Ciphers/02-stream-annotated.pdf |
6.6 MB |
| !Stanford/!Cryptography/Using Block Ciphers/recoded_videos_[f07da840] 4.2.mp4 |
5.5 MB |
| !Stanford/!Introduction to databases/06-03-xquery-intro.mp4 |
5.3 MB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/book.pdf |
4.8 MB |
| !Stanford/!Introduction to databases/04-01-introduction-to-SQL.mp4 |
4 MB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/A Programmer's Companion to Algorithm Analysis, Ernst L. Leiss, (CRC 2006).pdf |
3.7 MB |
| !Stanford/!Cryptography/ntb-v2.pdf |
3.5 MB |
| !Stanford/!Cryptography/Block Ciphers/03-block-annotated.pdf |
3 MB |
| !Stanford/!Cryptography/Introduction/01-intro-annotated.pdf |
2.3 MB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/all.pdf |
2 MB |
| !Stanford/!Cryptography/Using Block Ciphers/04-using-block-annotated.pdf |
1.5 MB |
| !Stanford/!Cryptography/Message Integrity/05-integrity-annotated.pdf |
1.1 MB |
| !Stanford/!Cryptography/Collision Resistance/06-collision-resistance.pdf |
825 KB |
| !Stanford/!Game Theory/lecture_slides_1.2 Predator Prey Example.pdf |
762 KB |
| !Stanford/!Game Theory/lecture_slides_1.5 Nash Equilibrium - Pure Strategy Definitions.pdf |
743 KB |
| !Stanford/!Game Theory/3.2 Minimax Theorem.pdf |
736 KB |
| !Stanford/!Game Theory/lecture_slides_1.4 Dominance.pdf |
660 KB |
| !Stanford/!Game Theory/3.3 Comparative Statics.pdf |
658 KB |
| !Stanford/!Game Theory/lecture_slides_1.3 Normal Form Definitions.pdf |
656 KB |
| !Stanford/!Game Theory/3.5 Existence of Nash Equilibrium.pdf |
643 KB |
| !Stanford/!Game Theory/2.4 Mixed Strategies.pdf |
591 KB |
| !Stanford/!Game Theory/2.2 Braess's Paradox.pdf |
568 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/Кнут Д. - Устойчивость супружеских пар и другие комбинаторные задачи Введение в математический анализ алгоритмов - 2011.djvu |
546 KB |
| !Stanford/!Design and Analysis of Algorithms/Кнут Д. - Устойчивость супружеских пар и другие комбинаторные задачи Введение в математический анализ алгоритмов - 2011.djvu |
546 KB |
| !Stanford/!Game Theory/2.1 Nash Equilibrium with Many Players.pdf |
546 KB |
| !Stanford/!Game Theory/3.4 Best Response, Multiple Equilibrium Revisted.pdf |
528 KB |
| !Stanford/!Game Theory/2.5 Pure and Mixed Equilibrium.pdf |
495 KB |
| !Stanford/!Game Theory/lecture_slides_1.6 Nash Equilibrium - Examples.pdf |
480 KB |
| !Stanford/!Game Theory/2.3 Tragedy of the Commons.pdf |
384 KB |
| !Stanford/!Cryptography/High School Mathematics Extensions-Discrete Probability - Wikibooks, open books for an open world.png |
367 KB |
| !Stanford/!Game Theory/1.1 Introduction and Logistics.pdf |
332 KB |
| !Stanford/!Design and Analysis of Algorithms/CS 161 - Design and Analysis of Algorithms.png |
309 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases5.mht |
268 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases6.mht |
250 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases17.mht |
245 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases16.mht |
243 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases2.mht |
240 KB |
| !Stanford/!Introduction to databases/Introduction to Databases.png |
182 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases.mht |
174 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases13.mht |
172 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases11.mht |
164 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases12.mht |
155 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases7.mht |
155 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases10.mht |
153 KB |
| !Stanford/!Introduction to databases/Introduction to Databases3.png |
148 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases22.mht |
144 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases18.mht |
138 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases3.mht |
138 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases14.mht |
137 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases19.mht |
137 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases20.mht |
133 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases15.mht |
133 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases21.mht |
133 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases4.mht |
130 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases9.mht |
129 KB |
| !Stanford/!Introduction to databases/materials/Introduction to Databases8.mht |
129 KB |
| !Stanford/!Cryptography/Video Listing.png |
118 KB |
| !Stanford/!Introduction to Human-Computer Interaction Design/CS147- Introduction to Human-Computer Interaction Design (Fall 2011) -- CourseWare.png |
112 KB |
| !Stanford/!Introduction to Human-Computer Interaction Design/Introduction to Human-Computer Interaction Design.png |
109 KB |
| !Stanford/!Cryptography/Home.png |
89 KB |
| !Stanford/!Cryptography/list.png |
84 KB |
| !Stanford/!Cryptography/Wiki - Syllabus.png |
79 KB |
| !Stanford/!Introduction to databases/Introduction to Databases2.png |
62 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap15-solutions.pdf |
44 KB |
| !Stanford/!Discrete Probability/Discrete Probability.png |
39 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap8-solutions.pdf |
36 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap14-solutions.pdf |
36 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap11-solutions.pdf |
35 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap13-solutions.pdf |
33 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap24-solutions.pdf |
32 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap16-solutions.pdf |
30 KB |
| !Stanford/!Cryptography/Message Integrity/5 - 3 - CBC-MAC and NMAC (20 min).srt |
29 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap6-solutions.pdf |
29 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap2-solutions.pdf |
28 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/capp.pdf |
27 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap26-solutions.pdf |
26 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap9-solutions.pdf |
26 KB |
| !Stanford/!Cryptography/Stream Ciphers/subtitles_8.txt |
25 KB |
| !Stanford/!Cryptography/Message Integrity/5 - 5 - PMAC and the Carter-Wegman MAC (16 min).srt |
24 KB |
| !Stanford/!Cryptography/Stream Ciphers/subtitles_6.txt |
24 KB |
| !Stanford/!Cryptography/Using Block Ciphers/subtitles_39.txt |
24 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap22-solutions.pdf |
23 KB |
| !Stanford/!Cryptography/Message Integrity/5 - 1 - Message Authentication Codes (16 min).srt |
23 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap5-solutions.pdf |
23 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap25-solutions.pdf |
23 KB |
| !Stanford/!Game Theory/2 - 2 - Normal Form Definitions Reshoot (16_54).srt |
22 KB |
| !Stanford/!Cryptography/Collision Resistance/6 - 2 - Generic birthday attack (16 min).srt |
22 KB |
| !Stanford/!Cryptography/Block Ciphers/subtitles_13.txt |
21 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap4-solutions.pdf |
21 KB |
| !Stanford/!Game Theory/2%20-%201%20-%20Predator%20Prey%20Example%20(14_47).txt |
20 KB |
| !Stanford/!Cryptography/Stream Ciphers/subtitles_5.txt |
19 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap12-solutions.pdf |
19 KB |
| !Stanford/!Cryptography/Stream Ciphers/subtitles_7.txt |
19 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap3-solutions.pdf |
19 KB |
| !Stanford/!Cryptography/Block Ciphers/subtitles_14.txt |
19 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap17-solutions.pdf |
19 KB |
| !Stanford/!Game Theory/3 - 8 - Best Response, Multiple Equilibrium Revisited (14_48).srt |
18 KB |
| !Stanford/!Cryptography/Introduction/subtitles_3.txt |
18 KB |
| !Stanford/!Cryptography/Stream Ciphers/subtitles_4.txt |
18 KB |
| !Stanford/!Cryptography/Collision Resistance/6 - 3 - The Merkle-Damgard Paradigm (12 min).srt |
18 KB |
| !Stanford/!Cryptography/Block Ciphers/subtitles_15.txt |
17 KB |
| !Stanford/!Cryptography/Block Ciphers/subtitles_12.txt |
17 KB |
| !Stanford/!Cryptography/Collision Resistance/6 - 1 - Introduction (11 min).srt |
17 KB |
| !Stanford/!Cryptography/Stream Ciphers/subtitles_9.txt |
17 KB |
| !Stanford/!Game Theory/3 - 4 - Mixed Strategies (13_24).srt |
16 KB |
| !Stanford/!Cryptography/Introduction/subtitles_2.txt |
16 KB |
| !Stanford/!Cryptography/Introduction/subtitles_11.txt |
16 KB |
| !Stanford/!Cryptography/Using Block Ciphers/subtitles_20.txt |
16 KB |
| !Stanford/!Cryptography/Message Integrity/5 - 2 - MACs Based On PRFs (10 min).srt |
15 KB |
| !Stanford/!Game Theory/2 - 6 - Nash Equilibrium - Examples (10_33).srt |
15 KB |
| !Stanford/!Game Theory/2 - 2 - Normal Form Definitions Reshoot (16_54).txt |
14 KB |
| !Stanford/!Cryptography/Block Ciphers/subtitles_16.txt |
14 KB |
| !Stanford/!Game Theory/2%20-%201%20-%20Predator%20Prey%20Example%20(14_47)2.txt |
14 KB |
| !Stanford/!Cryptography/Collision Resistance/6 - 6 - Timing attacks on MAC verification (9 min).srt |
13 KB |
| !Stanford/!Cryptography/Message Integrity/5 - 4 - MAC padding (9 min).srt |
13 KB |
| !Stanford/!Game Theory/2 - 3 - Normal Form Definitions (12_09).srt |
13 KB |
| !Stanford/!Game Theory/3 - 7 - Comparative Statics (10_50).srt |
13 KB |
| !Stanford/!Cryptography/Collision Resistance/6 - 4 - Constructing compression functions (8 min).srt |
13 KB |
| !Stanford/!Game Theory/3 - 3 - Tragedy of the Commons (11_20).srt |
13 KB |
| !Stanford/!Game Theory/3 - 1 - Nash Equilibrium with Many Players (9_42).srt |
13 KB |
| !Stanford/!Game Theory/3 - 8 - Best Response, Multiple Equilibrium Revisited (14_48).txt |
13 KB |
| !Stanford/!Game Theory/1%20-%201%20-%20Introduction%20and%20Logistics%20(8_19).srt |
12 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap21-solutions.pdf |
12 KB |
| !Stanford/!Game Theory/3 - 9 - Existence of Nash Equilibrium (9_50).srt |
12 KB |
| !Stanford/!Game Theory/1 - 1 - Introduction and Logistics (8_19).txt |
12 KB |
| !Stanford/!Cryptography/Block Ciphers/subtitles_17.txt |
12 KB |
| !Stanford/!Game Theory/3 - 6 - Minimax Theorem (11_20).srt |
12 KB |
| !Stanford/!Cryptography/Using Block Ciphers/subtitles_18.txt |
12 KB |
| !Stanford/!Cryptography/Introduction/subtitles_1.txt |
11 KB |
| !Stanford/!Game Theory/3 - 5 - Pure and Mixed Equilibrium (10_12).srt |
11 KB |
| !Stanford/!Game Theory/2 - 5 - Nash Equilibrium - Pure Strategy Definitions (8_24).srt |
11 KB |
| !Stanford/!Game Theory/3 - 4 - Mixed Strategies (13_24).txt |
11 KB |
| !Stanford/!Cryptography/Stream Ciphers/subtitles_10.txt |
11 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap23-solutions.pdf |
11 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/solutions/chap7-solutions.pdf |
10 KB |
| !Stanford/!Cryptography/Collision Resistance/6 - 5 - HMAC - a mac from SHA256 (7 min).srt |
10 KB |
| !Stanford/!Game Theory/2 - 6 - Nash Equilibrium - Examples (10_33).txt |
10 KB |
| !Stanford/!Game Theory/3 - 2 - Braess's Paradox (9_09).srt |
10 KB |
| !Stanford/!Cryptography/Using Block Ciphers/subtitles_21.txt |
10 KB |
| !Stanford/!Game Theory/2 - 3 - Normal Form Definitions (12_09).txt |
9 KB |
| !Stanford/!Game Theory/3 - 3 - Tragedy of the Commons (11_20).txt |
9 KB |
| !Stanford/!Game Theory/3 - 7 - Comparative Statics (10_50).txt |
9 KB |
| !Stanford/!Game Theory/3 - 1 - Nash Equilibrium with Many Players (9_42).txt |
9 KB |
| !Stanford/!Game Theory/3 - 9 - Existence of Nash Equilibrium (9_50).txt |
8 KB |
| !Stanford/!Cryptography/Using Block Ciphers/subtitles_19.txt |
8 KB |
| !Stanford/!Game Theory/3 - 6 - Minimax Theorem (11_20).txt |
8 KB |
| !Stanford/!Game Theory/3 - 5 - Pure and Mixed Equilibrium (10_12).txt |
8 KB |
| !Stanford/!Game Theory/2 - 5 - Nash Equilibrium - Pure Strategy Definitions (8_24).txt |
7 KB |
| !Stanford/!Game Theory/3 - 2 - Braess's Paradox (9_09).txt |
7 KB |
| !Stanford/!Game Theory/2 - 4 - Dominance (8_48).srt |
4 KB |
| !Stanford/!Game Theory/2 - 4 - Dominance (8_48).txt |
2 KB |
| !Stanford/!Design and Analysis of Algorithms/!KNOWLEDGEBASE/!Intr/name.txt |
123 B |
Magnet link
