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

Automata Theory
Stanford University via edX
Intro to Theoretical Computer Science
Udacity
Computing: Art, Magic, Science
ETH Zurich via edX
理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera