Lower Bounds for Dynamic Data Structures I

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


Duration: 56:53
937 views
15

Kasper Green Larsen, Aarhus University
https://simons.berkeley.edu/talks/lower-bounds-dynamic-data-structures-i-0
Lower Bounds in Computational Complexity Boot Camp



Other Videos By Simons Institute for the Theory of Computing


2018-08-28Sketching for Linear Algebra III: Randomized Hadamard, Kernel Methods
2018-08-27Sketching for Linear Algebra: Basics of Dimensionality Reduction and CountSketch II
2018-08-27Sketching for Linear Algebra: Basics of Dimensionality Reduction and CountSketch I
2018-08-27Foundations of Data Science II
2018-08-27Intro and Foundations of Data Science I
2018-08-24Impossibility Results for Distributed Computing II
2018-08-24Impossibility Results for Distributed Computing I
2018-08-24Time-Space Lower Bounds for Learning II
2018-08-24Time-Space Lower Bounds for Learning I
2018-08-23Lower Bounds for Dynamic Data Structures II
2018-08-23Lower Bounds for Dynamic Data Structures I
2018-08-23Communication Complexity II
2018-08-23Communication Complexity I
2018-08-22Lower Bounds in Arithmetic Circuit Complexity II
2018-08-22Lower Bounds in Arithmetic Circuit Complexity I
2018-08-22Geometric Complexity Theory II: Complexity Lower Bounds...
2018-08-22Geometric Complexity Theory I: Complexity Lower Bounds...
2018-08-21Derandomization from Circuit Lower Bounds II
2018-08-21Derandomization from Circuit Lower Bounds I
2018-08-21Lower Bounds Techniques in Proof Complexity II
2018-08-21Lower Bounds Techniques in Proof Complexity I


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Lower Bounds in Computational Complexity Boot Camp
Kasper Green Larsen