Theoretical Computer Science Courses and Certifications

Ryan O'Donnell

Hamming Code and Hadamard Code - Lecture 11c of CS Theory Toolkit

Explore Hamming and Hadamard codes: linear error correction techniques with contrasting rate and distance properties. Learn their applications in theoretical computer science research.

• YouTube
• 22 minutes
• Self-Paced
• Free Video

Ryan O'Donnell

Axioms of Quantum Computing - Lecture 9b of CS Theory Toolkit

Explore fundamental axioms of quantum mechanics for quantum computing, covering unitary matrices, qubit gates, and quantum circuits in this graduate-level lecture from Carnegie Mellon University.

• YouTube
• 41 minutes
• Self-Paced
• Free Video

Ryan O'Donnell

Fourier Analysis of Boolean Functions - Lecture 8a of CS Theory Toolkit

Explore Fourier analysis of Boolean functions, focusing on real-valued functions and their Fourier transforms in this graduate-level theoretical computer science lecture.

• YouTube
• 32 minutes
• Self-Paced
• Free Video

Ryan O'Donnell

Fast Fourier Transform - Lecture 7c of CS Theory Toolkit

Explore the Fast Fourier Transform algorithm and its application in efficient integer multiplication, with insights from a CMU graduate-level computer science theory course.

• YouTube
• 26 minutes
• Self-Paced
• Free Video

Ryan O'Donnell

Computational Models - Turing Machines - CMU - CS Theory Toolkit

Explore Turing Machines as a computational model, covering historical advantages, multitape variations, and key concepts like memory, time, and space bounds in theoretical computer science.

• YouTube
• 26 minutes
• Self-Paced
• Free Video

Ryan O'Donnell

Factorial Asymptotics, Stirling's Formula - Lecture 3b of CS Theory Toolkit

Explore factorial asymptotics and Stirling's Formula in this graduate-level lecture, covering mathematical techniques for theoretical computer science research.

• YouTube
• 28 minutes
• Self-Paced
• Free Video

Ryan O'Donnell

Big O and Friends - Lecture 2a of CS Theory Toolkit

Explore asymptotic notation in theoretical computer science, covering Big O, Omega, and related concepts. Essential for understanding algorithm efficiency and complexity analysis.

• YouTube
• 28 minutes
• Self-Paced
• Free Video

Ryan O'Donnell

Undergrad Complexity at CMU - Turing Machines

Explore Turing Machines in computational complexity theory, covering formalization, the Turing Thesis, examples, and mathematical definitions for a comprehensive understanding.

• YouTube
• 1 hour 20 minutes
• Self-Paced
• Free Video

Paul G. Allen School

Convex Optimization IV - Sebastien Bubeck, Microsoft Research

Explore advanced concepts in convex optimization, including gradient flow, comparison techniques, and optimal algorithms with Sebastien Bubeck from Microsoft Research.

• YouTube
• 1 hour 9 minutes
• Self-Paced
• Free Video

Institute for Advanced Study

An Introduction to Lifted Expander Graphs - Fernando Granha Jeronimo

Explore lifted expander graphs, their construction, and applications in theoretical computer science. Learn about symmetry structures, coding theory implications, and recent advancements in this field.

• YouTube
• 1 hour 55 minutes
• Self-Paced
• Free Video

Institute for Advanced Study

Univalence from a Computer Science Point-of-View - Dan Licata

Explore univalence in computer science with Dan Licata, covering Martin-Löf type theory, computation, and applications in homotopy theory and group structures.

• YouTube
• 56 minutes
• Self-Paced
• Free Video

Simons Institute

Optimal Broadcast Encryption and More from Evasive LWE

Explore advanced cryptographic techniques using evasive LWE, focusing on optimal broadcast encryption and its applications in secure communication systems.

• YouTube
• 46 minutes
• Self-Paced
• Free Video

Simons Institute

New Quantum Cryptographic Primitives I

Explore cutting-edge quantum cryptography with Mark Zhandry, delving into novel primitives and their implications for secure communication in the quantum era.

• YouTube
• 1 hour 5 minutes
• Self-Paced
• Free Video

Simons Institute

SAT-Solving

Explore the theory and practice of SAT-solving, delving into satisfiability concepts and advanced techniques in this comprehensive lecture by Armin Biere.

• YouTube
• 4 hours 23 minutes
• Self-Paced
• Free Video

Simons Institute

Improved Bounds for the Sunflower Lemma

Explore recent progress on the sunflower conjecture, examining structure vs pseudo-randomness and connections to DNF simplification under random restrictions.

• YouTube
• 1 hour 50 minutes
• Self-Paced
• Free Video