Introduction and ProofsMathematics for Computer Science · Lec 1·Formal Methods & Type Theory · Tom Leighton · MITTom LeightonMIT—44:09
Extremal Combinatorics Meets Algorithms and Data StructuresTheory & Algos·Research Seminar·Combinatorics & Graph Theory · Parinya Chalermsook · University of OxfordParinya ChalermsookUniversity of Oxford—50:24
The Role of Randomness in Local Distributed Graph ProblemsTheory & Algos·Research Seminar·Computational Complexity · Yannic Maus · Computational ComplexityYannic MausCCComputational Complexity—19:03
Mathematical InductionMathematics for Computer Science · Lec 2·Combinatorics & Graph Theory · Tom Leighton · MITTom LeightonMIT—1:19:25
Spectral Concentration and LearningAnalysis of Boolean Functions · Lec 5·Combinatorics & Graph Theory · Ryan O'Donnell · Carnegie Mellon UniversityRyan O'DonnellCarnegie Mellon University—1:20:14
Harmonic Numbers Asymptotics15-750 · A Theorist's Toolkit · Lec 4·Combinatorics & Graph Theory · Ryan O'Donnell · Carnegie Mellon UniversityRyan O'DonnellCarnegie Mellon University—22:18
Approximately Packing Dijoins Via Nowhere-Zero FlowsTheoretical Foundations of Modern Machine Learning · Lec 7·Graph Theory & Spectral Graphs · R Ravi · UC BerkeleyR RaviUC Berkeley—33:46
Strong InductionMathematics for Computer Science · Lec 3·Combinatorics & Graph Theory · Tom Leighton · MITTom LeightonMIT—1:22:00
Street Fighting Mathematics15-750 · A Theorist's Toolkit · Lec 2·Algorithms & Data Structures · Ryan O'Donnell · Carnegie Mellon UniversityRyan O'DonnellCarnegie Mellon University—26:10
Factorial Asymptotics, Stirling's Formula15-750 · A Theorist's Toolkit · Lec 8·Asymptotic Analysis & Lower Bounds · Ryan O'Donnell · Carnegie Mellon UniversityRyan O'DonnellCarnegie Mellon University—28:26
The Hypercontractivity TheoremAnalysis of Boolean Functions · Lec 18·Calculus & Analysis · Ryan O'Donnell · Carnegie Mellon UniversityRyan O'DonnellCarnegie Mellon University—1:17:32
Graph Theory and ColoringMathematics for Computer Science · Lec 6·Graph Theory & Spectral Graphs · Tom Leighton · MITTom LeightonMIT—1:22:51
Birthday Paradox Asymptotics15-750 · A Theorist's Toolkit · Lec 7·Probability & Information Theory · Ryan O'Donnell · Carnegie Mellon UniversityRyan O'DonnellCarnegie Mellon University—18:09
Matching ProblemsMathematics for Computer Science · Lec 7·Algorithms & Data Structures · Tom Leighton · MITTom LeightonMIT—1:22:40
Graph Theory II: Minimum Spanning TreesMathematics for Computer Science · Lec 8·Combinatorics & Graph Theory · Tom Leighton · MITTom LeightonMIT—1:23:26
Graph Theory IIIMathematics for Computer Science · Lec 10·Combinatorics & Graph Theory · Marten van Dijk · MITMarten van DijkMIT—1:22:50
Linear RecurrencesMathematics for Computer Science · Lec 15·Combinatorics & Generating Functions · Tom Leighton · MITTom LeightonMIT—1:18:20
Counting Rules IMathematics for Computer Science · Lec 16·Combinatorics & Generating Functions · Marten van Dijk · MITMarten van DijkMIT—1:20:02