Polynomial Data Structure Lower Bounds in the Group Model

Explore a 25-minute IEEE conference talk on polynomial data structure lower bounds in the group model. Delve into static data structures, their examples, and definitions before examining data structure lower bounds and models. Understand the group model and learn why efficient data structures are not diverse. Investigate how k-wise independence implies diversity, and discover the presenters' results and derandomization techniques. Gain insights from authors affiliated with Harvard University, Columbia University, and New York University as they discuss their research findings.