Breakthrough in Data Structures: Simulation Outperforms Traditional Richness Limits 🚀
Discover how new simulation techniques are challenging existing lower bounds in data structures, paving the way for more efficient algorithms. Presented by Arkadev Chattopadhyay from TIFR.
Simons Institute for the Theory of Computing
275 views • Oct 17, 2018
About this video
Arkadev Chattopadhyay (Tata Institute of Fundamental Research)
https://simons.berkeley.edu/talks/simulation-beats-richness-new-data-structure-lower-bounds
Interactive Complexity
https://simons.berkeley.edu/talks/simulation-beats-richness-new-data-structure-lower-bounds
Interactive Complexity
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
275
Likes
4
Duration
37:57
Published
Oct 17, 2018