32 citations · 162 across the 26 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017
Oblivious Routing via Random Walks
Michael Schapira, Gal Shahaf
We present novel oblivious routing algorithms for both splittable and unsplittable multicommodity flow. Our algorithm for minimizing congestion for \emph{unsplittable} multicommodi…
cs.DS2015
Explicit Expanding Expanders
Michael Dinitz, Michael Schapira, Asaf Valadarsky
Deterministic constructions of expander graphs have been an important topic of research in computer science and mathematics, with many well-studied constructions of infinite famili…