2 citations · 4 across the 12 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DS2020
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…
cs.DS2020
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…
cs.DS2020
Massively Parallel Algorithms for Distance Approximation and Spanners
Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari +2
Over the past decade, there has been increasing interest in distributed/parallel algorithms for processing large-scale graphs. By now, we have quite fast algorithms -- usually subl…