Theory of Computation
Michael Sipser's definitive course on finite automata, context-free grammars, Turing machines, decidability, reducibility, time and space complexity, NP-completeness, and interactive proofs.
Algorithms & Theory
Algorithms, data structures, computational complexity, cryptography, formal verification, logic, and type theory.
All Theory & AlgosAlgorithms & Data Structures (203)Computational Complexity (88)Cryptography (41)Probability & Information Theory (28)Neuroscience & Cognition (26)Calculus & Analysis (24)Complex Systems & Scaling (16)Computer Architecture (14)Signal Processing & Robotics (13)Dynamic Programming (13)
Essential Theory & Algos courses
Complete university lecture courses in algorithms & theory.
Introduction to Algorithms
Foundational MIT algorithms course covering asymptotic complexity, divide-and-conquer, hashing, balanced search trees, graph search, shortest paths, and dynamic programming.
Advanced Data Structures
Persistent data structures, retroactive structures, geometric range queries, dynamic optimality, splay trees, van Emde Boas trees, fusion trees, cache-oblivious structures, and succinct representations.
Introduction to Cryptography
Stream ciphers, DES, AES and finite-field arithmetic, block cipher modes, RSA, Diffie-Hellman key exchange, elliptic curve cryptography, hash functions, and digital signatures.
A Theorist's Toolkit
Essential mathematical machinery for theoretical computer science research: asymptotic tail bounds, spectral graph theory, expanders, linear and semidefinite programming duality, and Fourier analysis.
Mathematics for Computer Science
Discrete mathematical foundations for theoretical computer science: proof techniques, well-ordering, number theory, RSA cryptography, graph theory, recurrences, generating functions, and discrete probability.
Theory & Algos Double Feature
Two complementary theory & algos talks paired around a central intellectual tension.
Double Feature2 talks · 126m total
Hardness of Search & Zero-Knowledge Proofs
What makes mathematical witnesses easy to verify yet hard to find—and how interactive randomness lets you prove a theorem without revealing why it is true.
Part II · Zero-knowledge proofs1:03:26
Proofs, Knowledge, and Computation: Zero-Knowledge Interactive Systems
Standalone Theory & Algos talks
77Self-contained lectures, Nobel addresses, and research colloquia you can watch in one sitting.
6.034 Lecture 04: Search Algorithms - Depth First, Hill Climbing, and Beyond
A foundational lecture from MIT's 6.034 course, delving into classic search algorithms including depth-first and hill-climbing techniques in artificial intelligence.
Dancing Links: A Data Structure for Exact Covering Problems
Donald Knuth's 24th annual Christmas lecture, detailing the elegant 'Dancing Links' algorithm and its surprising effectiveness for solving exact covering problems across diverse applications.
A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies
Examine the computational complexity of linear optimization over convex bodies, presenting nearly quadratic lower bounds for randomized algorithms in the membership oracle model.
System Dynamics: Student Project Reviews and Model Refinement
An MIT OpenCourseWare session offering detailed technical critiques of student system dynamics models, emphasizing formulation, unit consistency, and strategies for model refinement.
Scheduling with Time-Evolving Uncertainty for Content Review in Social Media
Thodoris Lykouris (MIT) presents a novel approach to scheduling content review, addressing time-evolving uncertainty in social media moderation pipelines.
Learning Representations: A Challenge for Learning Theory, COLT 2013
Yann LeCun examines the fundamental challenges of learning theory in the context of representation learning, presented at the Conference on Learning Theory (COLT) in 2013.
Theory & Algos study paths
3
6 steps · 8h
Boolean Fourier Analysis to Quantum Complexity
Harmonic analysis on the hypercube, linearity testing, social choice, and quantum circuits
Carnegie Mellon University
6 curated lecturesOpen path →
6 steps · 6h4 universities
Computability, Zero-Knowledge & Differential Privacy
Automata, cryptographic hardness, interactive proofs, and privacy guarantees
MIT · Ruhr University Bochum · Harvard University +1
6 curated lecturesOpen path →
6 steps · 5h5 universities
Probability, Primes & Computational Hardness
Discrete proof invariants, stochastic conditioning, pseudorandomness, and P vs. NP
MIT · Harvard University · UCLA +2
6 curated lecturesOpen path →
Showing 20 of 370 lectures
Lecturej/k navigate · c chapters · s save · x watched
Scholar · University
Chapters · Duration
55:25
1:30:25
1:09:25
2:37:59
49:19
54:33
57:48
1:50:13
50:59
Theory & Algos·Public Colloquium · Minhyong Kim · International Centre for Mathematical Sciences, Edinburgh
54:19
1:10:02
1:32:41
1:40:59
1:11:03
1:19:45
1:22:00
20:32
29:57
16:57
1:13:30