Playlist: 23 videos

Interactive Complexity

1:5:27

The Hardest Halfspace

Alexander Sherstov (UCLA)
https://simons.berkeley.edu/talks/hardest-halfspace
Interactive Complexity
Visit talk page
0:33:22

Lower Bounds for Elimination via Weak Regularity

Michal Koucky (Charles University)
https://simons.berkeley.edu/talks/lower-bounds-elimination-weak-regularity
Interactive Complexity
Visit talk page
0:33:40

Round Elimination using Triangular Discrimination

Amir Yehudayoff (Technion Israel Institute of Technology)
https://simons.berkeley.edu/talks/round-elimination-using-triangular-discrimination
Interactive Complexity
Visit talk page
0:29:10

Quantum Algorithms for Composed Functions With Shared Inputs

Justin Thaler (Georgetown University)
https://simons.berkeley.edu/talks/quantum-algorithms-composed-functions-shared-inputs
Interactive Complexity
Visit talk page
0:34:5

Bounded Independence Plus Noise, and the Communication Complexity of Decoding

Emanuele Viola (Northeastern University)
https://simons.berkeley.edu/talks/bounded-independence-plus-noise-and-communication-complexity-decoding
Interactive Complexity
Visit talk page
0:25:24

Network Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All

Sumegha Garg (Princeton University)
https://simons.berkeley.edu/talks/network-coding-undirected-graphs-either-very-helpful-or-not-helpful-all
Interactive Complexity
Visit talk page
0:56:4

Advances in Linear Sketching over Finite Fields

Grigory Yaroslavtsev (Indiana University, Bloomington)
https://simons.berkeley.edu/talks/advances-linear-sketching-over-finite-fields
Interactive Complexity
Visit talk page
0:33:26

Strong Direct Sum for Randomized Query Complexity

Joshua Brody (Swarthmore College)
https://simons.berkeley.edu/talks/strong-direct-sum-randomized-query-complexity
Interactive Complexity
Visit talk page
0:35:36

On a Composition Theorem for Randomized Query Complexity

Troy Lee (Nanyang Technological University)
https://simons.berkeley.edu/talks/composition-theorem-randomized-query-complexity
Interactive Complexity
Visit talk page
0:33:22

Distributed Interactive Proofs

Rotem Oshman (Tel Aviv University)
https://simons.berkeley.edu/talks/distributed-interactive-proofs
Interactive Complexity
Visit talk page