Advanced Lessons

Lecture 13: Object Detection, Recognition and Pose Determination, PatQuick (US 7,016,539)

Example Seminar Discussion (CMS.S63 Playful Augmented Reality Audio Design Exploration)

State's Responsibility for Historical Injustices before International Institutions / Courts

15. Hearing and Speech

5. CF Pumping Lemma, Turing Machines

9. Reducibility

24. Probabilistic Computation (cont.)

7. Decision Problems for Automata and Grammars

26. coNP is a subset of IP

16. Cook-Levin Theorem

10. Computation History Method

18. PSPACE-Completeness

15. NP-Completeness

4. Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion

Lecture 9: Reference-Dependent Preferences

Lecture 3: Time Preferences (Theory) I

Lecture 4: Time Preferences (Theory) II

Video 7: Graph Theory (online class)

Class 6: Payments

15. Linearized gravity II: Dynamic sources

19. Cosmology II

6. Costs

13. Oligopoly

5. Production Theory

1. A bridge between graph theory and additive combinatorics

25. Structure of set addition V: additive energy and Balog-Szemerédi-Gowers theorem

4. Forbidding a subgraph III: algebraic constructions

12. Pseudorandom graphs II: second eigenvalue

22. Structure of set addition II: groups of bounded exponent and modeling lemma

6. Szemerédi's graph regularity lemma I: statement and proof

11. Pseudorandom graphs I: quasirandomness

19. Roth's theorem II: Fourier analytic proof in the integers

2. Forbidding a subgraph I: Mantel's theorem and Turán's theorem

15. Graph limits II: regularity and counting

20. Roth's theorem III: polynomial method and arithmetic regularity

24. Structure of set addition IV: proof of Freiman's theorem

5. Forbidding a subgraph IV: dependent random choice

7. Szemerédi's graph regularity lemma II: triangle removal lemma

18. Roth's theorem I: Fourier analytic proof over finite field

17. Graph limits IV: inequalities between subgraph densities

8. Szemerédi's graph regularity lemma III: further applications

10. Szemerédi's graph regularity lemma V: hypergraph removal and spectral proof

26. Sum-product problem and incidence geometry

7. Technical Challenges