Deterministic Distributed Expander Decomposition Routing with Applications in Distributed Derandomization

Deterministic Distributed Expander Decomposition Routing with Applications in Distributed Derandomization

Explore a 23-minute IEEE conference talk on deterministic distributed expander decomposition routing and its applications in distributed derandomization. Delve into the computation model, distributed expander decompositions, and routing algorithms presented by researchers from ETH Zurich and Toyota Technological Institute at Chicago. Learn about the novel deterministic approach to previously randomized algorithms, the distributed balanced sparse cut algorithm, and the recursive solution for expander routing problems. Gain insights into the research direction's ultimate goals and open questions in this field of distributed computing and graph theory.