| S# |
Lecture |
Course |
Institute |
Instructor |
Discipline |
| 1176 |
22. Structure of set addition II: groups of bounded exponent and modeling lemma (M-I-T)
|
Graph Theory and Additive Combinatorics, Fall 2019 (M-I-T)
|
MIT
|
Prof. Yufei Zhao
|
Basic and Health Sciences
|
| 1177 |
9. Szemerédi's graph regularity lemma IV: induced removal lemma (M-I-T)
|
Graph Theory and Additive Combinatorics, Fall 2019 (M-I-T)
|
MIT
|
Prof. Yufei Zhao
|
Basic and Health Sciences
|
| 1178 |
23. Structure of set addition III: Bogolyubov's lemma and the geometry of numbers (M-I-T)
|
Graph Theory and Additive Combinatorics, Fall 2019 (M-I-T)
|
MIT
|
Prof. Yufei Zhao
|
Basic and Health Sciences
|
| 1179 |
24. Structure of set addition IV: proof of Freiman's theorem (M-I-T)
|
Graph Theory and Additive Combinatorics, Fall 2019 (M-I-T)
|
MIT
|
Prof. Yufei Zhao
|
Basic and Health Sciences
|
| 1180 |
25. Structure of set addition V: additive energy and Balog-Szemerédi-Gowers theorem (M-I-T)
|
Graph Theory and Additive Combinatorics, Fall 2019 (M-I-T)
|
MIT
|
Prof. Yufei Zhao
|
Basic and Health Sciences
|
| 1181 |
26. Sum-product problem and incidence geometry (M-I-T)
|
Graph Theory and Additive Combinatorics, Fall 2019 (M-I-T)
|
MIT
|
Prof. Yufei Zhao
|
Basic and Health Sciences
|
| 1182 |
3. Forbidding a subgraph II: complete bipartite subgraph (M-I-T)
|
Graph Theory and Additive Combinatorics, Fall 2019 (M-I-T)
|
MIT
|
Prof. Yufei Zhao
|
Basic and Health Sciences
|
| 1183 |
4. Forbidding a subgraph III: algebraic constructions (M-I-T)
|
Graph Theory and Additive Combinatorics, Fall 2019 (M-I-T)
|
MIT
|
Prof. Yufei Zhao
|
Basic and Health Sciences
|
| 1184 |
5. Forbidding a subgraph IV: dependent random choice (M-I-T)
|
Graph Theory and Additive Combinatorics, Fall 2019 (M-I-T)
|
MIT
|
Prof. Yufei Zhao
|
Basic and Health Sciences
|
| 1185 |
6. Szemerédi's graph regularity lemma I: statement and proof (M-I-T)
|
Graph Theory and Additive Combinatorics, Fall 2019 (M-I-T)
|
MIT
|
Prof. Yufei Zhao
|
Basic and Health Sciences
|
| 1186 |
7. Szemerédi's graph regularity lemma II: triangle removal lemma (M-I-T)
|
Graph Theory and Additive Combinatorics, Fall 2019 (M-I-T)
|
MIT
|
Prof. Yufei Zhao
|
Basic and Health Sciences
|
| 1187 |
8. Szemerédi's graph regularity lemma III: further applications (M-I-T)
|
Graph Theory and Additive Combinatorics, Fall 2019 (M-I-T)
|
MIT
|
Prof. Yufei Zhao
|
Basic and Health Sciences
|
| 1188 |
An overview of modern climate modeling (M-I-T)
|
Introduction to Computational Thinking (Fall 2020) (M-I-T)
|
MIT
|
Prof. Alan Edelman, Prof. David P. Sanders, Grant Sanderson, Dr. James Schloss, and Henri Drake
|
Basic and Health Sciences
|
| 1189 |
Analysing Covid-19 data (M-I-T)
|
Introduction to Computational Thinking (Fall 2020) (M-I-T)
|
MIT
|
Prof. Alan Edelman, Prof. David P. Sanders, Grant Sanderson, Dr. James Schloss, and Henri Drake
|
Basic and Health Sciences
|
| 1190 |
Arrays: Slices and views (M-I-T)
|
Introduction to Computational Thinking (Fall 2020) (M-I-T)
|
MIT
|
Prof. Alan Edelman, Prof. David P. Sanders, Grant Sanderson, Dr. James Schloss, and Henri Drake
|
Basic and Health Sciences
|
| 1191 |
Basics of arrays in Julia (M-I-T)
|
Introduction to Computational Thinking (Fall 2020) (M-I-T)
|
MIT
|
Prof. Alan Edelman, Prof. David P. Sanders, Grant Sanderson, Dr. James Schloss, and Henri Drake
|
Basic and Health Sciences
|
| 1192 |
Billiard models and event-driven simulations (M-I-T)
|
Introduction to Computational Thinking (Fall 2020) (M-I-T)
|
MIT
|
Prof. Alan Edelman, Prof. David P. Sanders, Grant Sanderson, Dr. James Schloss, and Henri Drake
|
Basic and Health Sciences
|
| 1193 |
Building an ocean model from scratch (M-I-T)
|
Introduction to Computational Thinking (Fall 2020) (M-I-T)
|
MIT
|
Prof. Alan Edelman, Prof. David P. Sanders, Grant Sanderson, Dr. James Schloss, and Henri Drake
|
Basic and Health Sciences
|
| 1194 |
|
Introduction to Computational Thinking (Fall 2020) (M-I-T)
|
MIT
|
Prof. Alan Edelman, Prof. David P. Sanders, Grant Sanderson, Dr. James Schloss, and Henri Drake
|
Basic and Health Sciences
|
| 1195 |
Computational thinking illustrated (M-I-T)
|
Introduction to Computational Thinking (Fall 2020) (M-I-T)
|
MIT
|
Prof. Alan Edelman, Prof. David P. Sanders, Grant Sanderson, Dr. James Schloss, and Henri Drake
|
Basic and Health Sciences
|
| 1196 |
Convolutions in image processing (M-I-T)
|
Introduction to Computational Thinking (Fall 2020) (M-I-T)
|
MIT
|
Prof. Alan Edelman, Prof. David P. Sanders, Grant Sanderson, Dr. James Schloss, and Henri Drake
|
Basic and Health Sciences
|
| 1197 |
Image seam reminiscing (M-I-T)
|
Introduction to Computational Thinking (Fall 2020) (M-I-T)
|
MIT
|
Prof. Alan Edelman, Prof. David P. Sanders, Grant Sanderson, Dr. James Schloss, and Henri Drake
|
Basic and Health Sciences
|
| 1198 |
Convolutions in the real world (M-I-T)
|
Introduction to Computational Thinking (Fall 2020) (M-I-T)
|
MIT
|
Prof. Alan Edelman, Prof. David P. Sanders, Grant Sanderson, Dr. James Schloss, and Henri Drake
|
Basic and Health Sciences
|
| 1199 |
Introduction to climate modeling (M-I-T)
|
Introduction to Computational Thinking (Fall 2020) (M-I-T)
|
MIT
|
Prof. Alan Edelman, Prof. David P. Sanders, Grant Sanderson, Dr. James Schloss, and Henri Drake
|
Basic and Health Sciences
|
| 1200 |
Convolutions on GPUs (M-I-T)
|
Introduction to Computational Thinking (Fall 2020) (M-I-T)
|
MIT
|
Prof. Alan Edelman, Prof. David P. Sanders, Grant Sanderson, Dr. James Schloss, and Henri Drake
|
Basic and Health Sciences
|
