Ryan O'Donnell Courses

Learning About Quantum States - Majorization Theorems for the RSK Process

Explore combinatorial theorems on RSK process applied to random words, focusing on Young diagram majorization in different scenarios.

• YouTube
• 22 minutes
• On-Demand
• Free Video

High-Dimensional Expanders - How I Learned to Stop Worrying and Love Group-Theoretic Constructions

Explore high-dimensional expanders, focusing on 2-dimensional cases, graphs of constant link, and group-theoretic constructions. Gain insights into advanced mathematical concepts and recent research developments.

• YouTube
• 47 minutes
• On-Demand
• Free Video

Quantum Computing with Just 1 Qubit - The Elitzur-Vaidman Bomb Algorithm

Explore quantum computing fundamentals and the Elitzur-Vaidman bomb detection algorithm using a single qubit, covering key concepts and practical applications in this engaging lecture.

• YouTube
• 1 hour 8 minutes
• On-Demand
• Free Video

Improved Quantum Data Analysis - Shadow Tomography

Explore improved quantum shadow tomography, focusing on optimal dependence on observables, dimension, and error tolerance. Learn connections to adaptive data analysis in this advanced talk.

• YouTube
• 59 minutes
• On-Demand
• Free Video

Dinur's PCP- Degree-Reduction, Expanderizing, Mini-PCP - Lecture 27c of CS Theory Toolkit

Explore Dinur's PCP Theorem proof, covering degree-reduction, expanderizing, and alphabet-reduction in theoretical computer science. Gain insights into advanced concepts for research in computational complexity.

• YouTube
• 26 minutes
• On-Demand
• Free Video

Deterministic Communication Complexity - Lecture 23b of CS Theory Toolkit

Explore deterministic communication complexity, protocols, matrices, and the Log Rank conjecture in this graduate-level lecture on theoretical computer science fundamentals.

• YouTube
• 37 minutes
• On-Demand
• Free Video

Trees and Series-Parallel Graphs - Lecture 22a of CS Theory Toolkit

Explore treewidth, CSPs, and graph theory fundamentals for theoretical computer science research, focusing on trees and series-parallel graphs.

• YouTube
• 21 minutes
• On-Demand
• Free Video

Constraint Satisfaction Problems - Lecture 20b of CS Theory Toolkit

Explore Constraint Satisfaction Problems, their formal definition, examples, and algorithms. Learn about the Dichotomy Theorem and its implications for theoretical computer science research.

• YouTube
• 32 minutes
• On-Demand
• Free Video

Goemans-Williamson: Rounding the Max-Cut SDP - Lecture 20a of CS Theory Toolkit

Efficient algorithm for approximating maximum graph cuts using semidefinite programming and randomized rounding, with guaranteed performance ratio of 0.878.

• YouTube
• 32 minutes
• On-Demand
• Free Video

The SDP Relaxation for Max-Cut - Lecture 19b of CS Theory Toolkit

Explore SDP relaxation for Max-Cut, transforming a quadratic program into a semidefinite program solvable by the Ellipsoid Algorithm. Part of CMU's graduate-level CS Theory Toolkit course.

• YouTube
• 33 minutes
• On-Demand
• Free Video

The Ellipsoid Algorithm - Lecture 19a of CS Theory Toolkit

Explore the Ellipsoid Algorithm for solving Linear Programming and convex optimization, focusing on its polynomial-time efficiency and use of separation oracles in theoretical computer science.

• YouTube
• 31 minutes
• On-Demand
• Free Video

Linear Programming - Bit Complexity - Lecture 17c of CS Theory Toolkit

Explore bit complexity in Linear Programming, feasible solutions, and the implications for NP ∩ coNP. Delve into fundamental concepts for theoretical computer science research.

• YouTube
• 25 minutes
• On-Demand
• Free Video

Linear Programming Duality - Lecture 17b of CS Theory Toolkit

Explore linear programming duality, Farkas Lemma, and Fourier-Motzkin elimination in this graduate-level lecture on fundamental concepts for theoretical computer science research.

• YouTube
• 22 minutes
• On-Demand
• Free Video

Expander Graph Application 2: Derandomization - Lecture 16c of CS Theory Toolkit

Explore derandomization techniques using expander graphs to reduce error in randomized algorithms without significantly increasing random bits used.

• YouTube
• 23 minutes
• On-Demand
• Free Video

Expander Graph Constructions - Lecture of CS Theory Toolkit

Explore explicit expander graph constructions, including Gabber-Galil, Ramanujan, and Zig-Zag product expanders. Learn about their properties, applications, and mathematical foundations in theoretical computer science.

• YouTube
• 49 minutes
• On-Demand
• Free Video