YoVDO

Theoretical Computer Science Courses

Bin Packing Can Be Solved Within 1 + ε in Linear Time - Lecture
PapersWeLove via YouTube
An Improved Line-Point Low-Degree Test for Polynomials Over Finite Fields - Lecture
Institute for Advanced Study via YouTube
Concentration on HDX: Derandomization Beyond Chernoff - Lecture
Institute for Advanced Study via YouTube
Mestrado: Computação, Lógica e Teoria dos Conjuntos - Aula 01
Instituto de Matemática Pura e Aplicada via YouTube
Böhm Trees and Taylor Expansion
Centre International de Rencontres Mathématiques via YouTube
String Attractors of Rote Sequences
Centre International de Rencontres Mathématiques via YouTube
Thue Choice Number and the Counting Argument
Centre International de Rencontres Mathématiques via YouTube
Derandomization and Meta-complexity - Part 2
Centre International de Rencontres Mathématiques via YouTube
Tutorial on Cellular Automata - Lecture 2
Centre International de Rencontres Mathématiques via YouTube
Computer Science Topics for Rails Developers - Relevance and Applications
Confreaks via YouTube
< Prev Page 42 Next >