19 citations · 110 across the 50 of their papers we have counts for
5 papers · 2 filters
New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the Barrier
Shimon Kogan, Merav Parter
For an -vertex digraph , a \emph{shortcut set} is a (small) subset of edges taken from the transitive closure of that, when added to guarantees that the dia…
Low-Congestion Shortcuts in Constant Diameter Graphs
Shimon Kogan, Merav Parter
Low congestion shortcuts, introduced by Ghaffari and Haeupler (SODA 2016), provide a unified framework for global optimization problems in the congest model of distributed computin…
Component Stability in Low-Space Massively Parallel Computation
Artur Czumaj, Peter Davies, Merav Parter
We study the power and limitations of component-stable algorithms in the low-space model of Massively Parallel Computation (MPC). Recently Ghaffari, Kuhn and Uitto (FOCS 2019) intr…
Fault-Tolerant Labeling and Compact Routing Schemes
Michal Dory, Merav Parter
The paper presents fault-tolerant (FT) labeling schemes for general graphs, as well as, improved FT routing schemes. For a given -vertex graph and a bound on the number…
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs
Greg Bodwin, Merav Parter
The restoration lemma by Afek, Bremler-Barr, Kaplan, Cohen, and Merritt [Dist. Comp. '02] proves that, in an undirected unweighted graph, any replacement shortest path avoiding a f…