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

An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature
IEEE via YouTube
Computation in the Brain Tutorial - Part 2
IEEE via YouTube
Computation in the Brain - Part 1
IEEE via YouTube
Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube
Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube