Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Graph Problems

2 of 16

2 of 16

Graph Problems

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms

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

  1. 1 Streaming Model
  2. 2 Graph Problems
  3. 3 Graph Streaming
  4. 4 State of the Art* [with a gross oversimplification]
  5. 5 Motivation of this work
  6. 6 Studied Problems
  7. 7 Our Results
  8. 8 Our Approach in a Nutshell
  9. 9 Ruzsa-Szemeredi (RS) Graphs
  10. 10 Single-Pass Lower Bound
  11. 11 The Abstract Problem
  12. 12 "Finding": €-Solving Set Intersectio..
  13. 13 Lower Bound of Abstract Problem
  14. 14 Summary of First Pass
  15. 15 Summary of Second Pass
  16. 16 Concluding Remarks

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.