Theoretical Computer Science Courses
Association for Computing Machinery (ACM) via YouTube A Polynomial Lower Bound on Adaptive Complexity of Submodular Maximization
Association for Computing Machinery (ACM) via YouTube Leslie G. Valiant - Turing Award Lecture 2010
Association for Computing Machinery (ACM) via YouTube Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control
TheIACR via YouTube Non-Interactive Zero-Knowledge in Pairing-Free Groups from Weaker Assumptions
TheIACR via YouTube On Finding Quantum Multi-Collisions
TheIACR via YouTube Certified Randomness from Quantum Supremacy
TheIACR via YouTube Statistical Witness Indistinguishability -and More- in Two Messages
TheIACR via YouTube How to Start Using Coroutines
NDC Conferences via YouTube What Computers Can't Do - With Kevin Buzzard
The Royal Institution via YouTube