Deterministic Distributed Expander Decomposition Routing with Applications in Distributed Derandomization

Deterministic Distributed Expander Decomposition Routing with Applications in Distributed Derandomization

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Open questions The ultimate goal of this research direction

9 of 9

9 of 9

Open questions The ultimate goal of this research direction

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Deterministic Distributed Expander Decomposition Routing with Applications in Distributed Derandomization

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

  1. 1 Intro
  2. 2 Computation model
  3. 3 Further applications of distributed expander decompositions
  4. 4 Deterministic distributed expander decompositions and routing All previous distributed algorithms for expander decompositions and routing are randomized.
  5. 5 Distributed expander decomposition algorithm
  6. 6 Review of the sequential recursive
  7. 7 Distributed balanced sparse cut algorithm
  8. 8 Distributed expander routing algorithm The simultaneous embeddings of high-conductance graphs to ... also allow us to solve the expander routing problem recursively
  9. 9 Open questions The ultimate goal of this research direction

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.