Polynomial Data Structure Lower Bounds in the Group Model

Polynomial Data Structure Lower Bounds in the Group Model

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Efficient DS is not Diverse

7 of 10

7 of 10

Efficient DS is not Diverse

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Polynomial Data Structure Lower Bounds in the Group Model

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Static Data Structures. Examples
  3. 3 Static Data Structures. Definition
  4. 4 DS Lower Bounds
  5. 5 DS Models
  6. 6 Group Model
  7. 7 Efficient DS is not Diverse
  8. 8 k-wise Independence Implies Diversity
  9. 9 Our Result
  10. 10 Derandomization

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.