YoVDO

Polynomial Data Structure Lower Bounds in the Group Model

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Data Structures Courses Theoretical Computer Science Courses Derandomization Courses

Course Description

Overview

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.

Syllabus

Intro
Static Data Structures. Examples
Static Data Structures. Definition
DS Lower Bounds
DS Models
Group Model
Efficient DS is not Diverse
k-wise Independence Implies Diversity
Our Result
Derandomization


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Randomized Methods in Complexity
Indian Institute of Technology Kanpur via Swayam
Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization - Lijie Chen
Institute for Advanced Study via YouTube
Expander Graph Application 2: Derandomization - Lecture 16c of CS Theory Toolkit
Ryan O'Donnell via YouTube
Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization
Association for Computing Machinery (ACM) via YouTube
High-Precision Estimation of Random Walks in Small Space
IEEE via YouTube