Data structures have applications and connections to algorithm
design, database systems, streaming algorithms and other areas of computer
science. Understanding what efficient data structures can do (and what they
cannot do) is crucial to these applications. In this talk, I will present my
work in analyzing efficient data structures and proving what they cannot
accomplish. I will focus on the recent development in building new connections
between dynamic data structures and communication complexity, as well as a new
approach to analyze dynamic data structures with Boolean outputs and super-
logarithmic time.