Innovations in Theoretical Computer Science 2020 - Session 6
Explore cutting-edge research in theoretical computer science, including scheduling algorithms, online computation, network coordination games, tournament rules, and prophet inequalities.
Innovations in Theoretical Computer Science 2020 - Session 9
Cutting-edge research in theoretical computer science, covering topics like distribution testing, random object sampling, probability distribution learning, agreement expansion, neural networks, and influence maximization.
Innovations in Theoretical Computer Science 2020 - Session 10
Explores cutting-edge research in theoretical computer science, covering topics like computational hardness, random strings, decision trees, and pseudorandomness. Features presentations from leading experts in the field.
Estimating the Difficulty of Breaking Lattice-Based Cryptography
Explore cutting-edge research on lattice-based cryptography security, focusing on difficulty estimation techniques for breaking these advanced encryption systems.
Quantum Program Analysis: Verification and Testing
Explore quantum program analysis techniques, including Quantum Hoare logic, Incorrectness logic, and relational Hoare logic. Learn about verifying correctness and catching bugs in quantum programs.
Polynomial-time Classical Simulation of Roetteler's Shifted Bent Function Algorithm
Explore polynomial-time classical simulation of Roetteler's shifted bent function algorithm, examining symbolic rewriting techniques and their implications for quantum circuit analysis.
Lower Bounds on the Size of Linear Programs
Explore computational complexity, linear programming, and extended formulations in this lecture on lower bounds for linear program sizes, featuring geometric views and advanced topics.
Power of Active Sampling for Unsupervised Learning
Explore active sampling techniques for unsupervised learning, focusing on matrix completion, graphical models, and clustering. Learn about statistical tradeoffs and computational complexity.
Understanding and Extending the Quasipolynomial Time Algorithms for Parity Games
Explore quasipolynomial algorithms for parity games, universal trees, and their extensions to universal graphs. Discover recent advancements in game-solving algorithms and complexity bounds.
Shafi Goldwasser: Journey from Israel to Turing Award - A Life in Computer Science
Explore Shafi Goldwasser's journey from childhood in Israel to becoming a pioneering computer scientist, covering her education, influences, and experiences that shaped her career.
PCPs and Global Hyper-contractivity - Lecture 3
Explore advanced concepts in PCPs and global hyper-contractivity with Dor Minzer, delving into complex mathematical theories and their applications in analysis and theoretical computer science.
Unique Games and Expansion
Explore algorithms for Unique Games on certifiable small-set expanders and graphs with certifiable global hypercontractivity, providing insights into the 2-2 Games hardness result.
Explicit SoS Lower Bounds from Small-Set High Dimensional Expanders
Explores explicit CSPs hard for Sum-of-Squares hierarchy using small-set high dimensional expanders, introducing new isoperimetric inequality for Square Cayley Complexes to construct optimally hard XOR-families.
RWKV- Reinventing RNNs for the Transformer Era
Explore RWKV, a novel architecture combining Transformer and RNN strengths. Learn about its linear attention mechanism, scalability, and performance in NLP tasks.
Graph Data Structures - Part 2
Explore advanced graph data structures and optimization techniques for designing efficient algorithms in this in-depth lecture by Thatchaphol Saranurak.
Graph Data Structures Part 3
Explore advanced graph data structures and optimization techniques for designing efficient algorithms, presented by Thatchaphol Saranurak from the University of Michigan.
Graph Data Structures - Part 1
Explore fundamental graph data structures and their applications in algorithmic optimization, presented by a leading expert from the University of Michigan.
Validated Quantum Advantage via Bell Sampling
Explore Bell sampling as a new model for demonstrating quantum computational advantage, discussing its potential for efficient verification and robustness against noise in quantum circuits.
Quantum Advantage with Shallow Clifford Circuits
Explore Clifford circuits' quantum advantage over classical counterparts, including constant-depth capabilities and open problems in this cutting-edge quantum computing research area.
Transparent SNARKs from DARK Compilers
Explore transparent SNARKs and DARK compilers in cryptography. Learn about polynomial commitments, interactive proof systems, and recent advancements in zero-knowledge proofs for blockchain applications.
Asymmetric Traveling Salesman Problem: Advances and Challenges - Session 1A
Explore cutting-edge research on the Asymmetric Traveling Salesman Problem, including algorithms, lower bounds, and approximation results in this advanced theoretical computer science talk.