Algorithms & Theory

Algorithms, data structures, computational complexity, cryptography, formal verification, logic, and type theory.

13 courses · 77 standalone talks · 370 total lectures

All Theory & Algos Algorithms & 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)

Showing 20 of 88 lectures

Lecturej/k navigate · c chapters · s save · x watched

Scholar · University

Chapters · Duration

A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies

A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies

Theory & Algos·Research Seminar · Santosh Vempala · Georgia Institute of Technology

Santosh Vempala Georgia Institute of Technology

1:09:25

Learning Representations: A Challenge for Learning Theory, COLT 2013

Learning Representations: A Challenge for Learning Theory, COLT 2013

Theory & Algos·Conference Talk · Yann LeCun · New York University

Yann LeCun New York University

54:33

The Exponential Time Hypothesis: Foundations of Computational Hardness

The Exponential Time Hypothesis: Foundations of Computational Hardness

Theory & Algos·Standalone Lecture · Ryan O'Donnell · Carnegie Mellon University

Ryan O'Donnell Carnegie Mellon University

1:19:45

Essential Hardness: Completing the Exponential Time Hypothesis Proof

Essential Hardness: Completing the Exponential Time Hypothesis Proof

Theory & Algos·Standalone Lecture · Ryan O'Donnell · Carnegie Mellon University

Ryan O'Donnell Carnegie Mellon University

1:22:00

What Needs to Be Added to Machine Learning? PAC Learning and Reasoning

What Needs to Be Added to Machine Learning? PAC Learning and Reasoning

Theory & Algos·Research Seminar · Leslie G. Valiant · Harvard University

Leslie G. Valiant Harvard University

54:36

Mathematics and Computation: The Landscape of P vs. NP

Mathematics and Computation: The Landscape of P vs. NP

Theory & Algos·Public Colloquium · Avi Wigderson · Institute for Advanced Study

Avi Wigderson Institute for Advanced Study

1:02:49

The Conscious Turing Machine (CTM), a formally defined Theoretical model of Consciousness (SIMONS-TCS-ML)

The Conscious Turing Machine (CTM), a formally defined Theoretical model of Consciousness (SIMONS-TCS-ML)

SIMONS-TCS-ML · Lec 14 · Manuel Blum · UC Berkeley / Simons Institute

Manuel Blum UC Berkeley / Simons Institute

45:00

The Role of TCS in Understanding (AI) Consciousness (SIMONS-TCS-ML)

The Role of TCS in Understanding (AI) Consciousness (SIMONS-TCS-ML)

SIMONS-TCS-ML · Lec 13 · Lenore Blum · UC Berkeley / Simons Institute

Lenore Blum UC Berkeley / Simons Institute

43:21

Secure Computation and Low-Complexity Cryptography

Secure Computation and Low-Complexity Cryptography

Theory & Algos·Research Seminar · Complexity Cryptography · UC Berkeley / Simons Institute

Complexity Cryptography UC Berkeley / Simons Institute

1:06:15

Efficient Fine-Grained Algorithms

Efficient Fine-Grained Algorithms

Theory & Algos·Research Seminar · Barna Saha · UC Berkeley

Barna Saha UC Berkeley

43:10

Complexity of Lasso with Normalized Data

Complexity of Lasso with Normalized Data

Theory & Algos·Research Seminar · Vladimir Dragovich · University of Texas

Vladimir Dragovich University of Texas

59:53

How Hard is too Hard? An Introduction to Complexity

How Hard is too Hard? An Introduction to Complexity

Theory & Algos·Public Colloquium · Colva Roney-Dougal · Gresham College

Colva Roney-Dougal Gresham College

44:23

Strange Gaps in the Local Time Hierarchy

Strange Gaps in the Local Time Hierarchy

Theory & Algos·Research Seminar · Seth Pettie · University of Michigan

Seth Pettie University of Michigan

56:46

The Role of Randomness in Local Distributed Graph Problems

The Role of Randomness in Local Distributed Graph Problems

Theory & Algos·Research Seminar · Yannic Maus · Computational Complexity

Yannic Maus Computational Complexity

19:03

Beyond Naïve Approximation for Longest Common Subsequence

Beyond Naïve Approximation for Longest Common Subsequence

Theory & Algos·Research Seminar · Debarati Das · University of Copenhagen

Debarati Das University of Copenhagen

17:16

Conditional Hardness for the Fréchet Distance Under Translation

Conditional Hardness for the Fréchet Distance Under Translation

Theory & Algos·Research Seminar · Andre Nusser · Max Planck Institute for Informatics

Andre Nusser Max Planck Institute for Informatics

17:08

Complexity of Answering Unions of Conjunctive Queries

Complexity of Answering Unions of Conjunctive Queries

Systems & CS·Research Seminar · Nofar Carmeli · Harvard University

Nofar Carmeli Harvard University

16:03

A Fine-Grained Analogue of Schaefer's Theorem in P

A Fine-Grained Analogue of Schaefer's Theorem in P

Theory & Algos·Research Seminar · Marvin Kunneman · Max Planck Institute for Informatics

Marvin Kunneman Max Planck Institute for Informatics

20:25

All Non-Trivial Variants of 3-LDT

All Non-Trivial Variants of 3-LDT

Theory & Algos·Research Seminar · B. Dudek & P. Gawrychowski · University of Wrocław

B. Dudek & P. Gawrychowski University of Wrocław

21:57

Super Turing Computing: Foundations for Aware and Ever-Adapting Systems

Super Turing Computing: Foundations for Aware and Ever-Adapting Systems

Theory & Algos·Research Seminar · Hava T. Siegelmann · Tufts University

Hava T. Siegelmann Tufts University

50:55

More categories

Systems & CS (504)Mathematics (518)Physics & Cosmology (366)AI & Machine Learning (283)History & Humanities (371)Philosophy & Ethics (286)Biology & Neuroscience (332)Economics & Finance (323)Engineering & Robotics (333)