Yes, There is an Oblivious RAM Lower Bound!

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=Eqb3HGDegvw


Duration: 32:46
692 views
6

Kasper Green Larsen (Aarhaus University)
https://simons.berkeley.edu/talks/yes-there-oblivious-ram-lower-bound
Interactive Complexity



Other Videos By Simons Institute for the Theory of Computing


2018-10-18The Sketching Complexity of Graph and Hypergraph Counting
2018-10-18Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation
2018-10-18On the Deterministic Complexity of Counting Events in a Stream
2018-10-18Sparse MDS Matrices: Proof of the GM-MDS Conjecture
2018-10-17Tight Cell Probe Bounds for Succinct Boolean Matrix-Vector Multiplication
2018-10-17Why Extension-Based Proofs Fail
2018-10-17Simulation beats Richness: New Data-Structure Lower Bounds
2018-10-17Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers
2018-10-17Static Data Structure Lower Bounds Imply Rigidity
2018-10-16Time-Space Tradeoffs for the Memory Game
2018-10-16Yes, There is an Oblivious RAM Lower Bound!
2018-10-16Distributed Interactive Proofs
2018-10-16On a Composition Theorem for Randomized Query Complexity
2018-10-16Strong Direct Sum for Randomized Query Complexity
2018-10-16Advances in Linear Sketching over Finite Fields
2018-10-15Network Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All
2018-10-15Bounded Independence Plus Noise, and the Communication Complexity of Decoding
2018-10-15Quantum Algorithms for Composed Functions With Shared Inputs
2018-10-15Round Elimination using Triangular Discrimination
2018-10-15Lower Bounds for Elimination via Weak Regularity
2018-10-15The Hardest Halfspace


Tags:
Interactive Complexity
Kasper Green Larsen
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley