2 citations · 2 across the 3 of their papers we have counts for
9 papers · 1 filter
Massively Parallel Algorithms for Approximate Shortest Paths
Michal Dory, Shaked Matar
We present fast algorithms for approximate shortest paths in the massively parallel computation (MPC) model. We provide randomized algorithms that take rounds…
A Nearly Time-Optimal Distributed Approximation of Minimum Cost -Edge-Connected Spanning Subgraph
Michal Dory, Mohsen Ghaffari
The minimum-cost -edge-connected spanning subgraph (-ECSS) problem is a generalization and strengthening of the well-studied minimum-cost spanning tree (MST) problem. While t…
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…
Distributed Weighted Min-Cut in Nearly-Optimal Time
Michal Dory, Yuval Efron, Sagnik Mukhopadhyay +1
Minimum-weight cut (min-cut) is a basic measure of a network's connectivity strength. While the min-cut can be computed efficiently in the sequential setting [Karger STOC'96], ther…
Exponentially Faster Shortest Paths in the Congested Clique
Michal Dory, Merav Parter
We present improved deterministic algorithms for approximating shortest paths in the Congested Clique model of distributed computing. We obtain -round algorithms…
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph
Michal Dory, Mohsen Ghaffari
The minimum-weight -edge-connected spanning subgraph (2-ECSS) problem is a natural generalization of the well-studied minimum-weight spanning tree (MST) problem, and it has rece…