Conference Papers
2025
Distributed Maximum Flow in Planar Graphs
Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann
PODC 2025
[arXiv]
2024
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos
ICALP 2024
[arXiv]
Improved All-Pairs Approximate Shortest Paths in Congested Clique
Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf
PODC 2024
Best Student Paper Award
[arXiv]
Massively Parallel Algorithms for Approximate Shortest Paths
Michal Dory, Shaked Matar
SPAA 2024
Fast Broadcast in Highly Connected Networks
Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf
SPAA 2024
[arXiv]
Fast 2-Approximate All-Pairs Shortest Paths
Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos
SODA 2024
[arXiv]
Brief Announcement: Distributed Maximum Flow in Planar Graphs
Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann
DISC 2024
2023
A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph
Michal Dory, Mohsen Ghaffari
SODA 2023
[paper][arXiv][slides]
2022
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs
Michal Dory, Mohsen Ghaffari, Saeed Ilchi
PODC 2022
[paper][arXiv]
2021
Fault-Tolerant Labeling and Compact Routing Schemes
Michal Dory, Merav Parter
PODC 2021
[paper][arXiv][slides][talk]
Constant-Round Spanners and Shortest Paths in Congested Clique and MPC
Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf
PODC 2021
[paper][Orr's talk]
Massively Parallel Algorithms for Distance Approximation and Spanners
Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari
SPAA 2021
[paper][arXiv][Shankha's talk]
Distributed Weighted Min-Cut in Nearly-Optimal Time
Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai
STOC 2021
[paper][arXiv][slides][short talk][long talk][Yuval's talk]
2020
Exponentially Faster Shortest Paths in the Congested Clique
Michal Dory, Merav Parter
PODC 2020
Best Paper Award
[paper][arXiv][slides][short talk][long talk]
2019
Fast Approximate Shortest Paths in the Congested Clique
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
PODC 2019
Best Student Paper Award
[paper][arXiv][slides]
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph
Michal Dory, Mohsen Ghaffari
PODC 2019
[paper][arXiv][slides]
Hardness of Distributed Optimization
Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz
PODC 2019
[paper][arXiv]
2018
Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs
Michal Dory
PODC 2018
[paper] [arXiv] [slides]
Distributed Spanner Approximation
Keren Censor-Hillel, Michal Dory
PODC 2018
[paper] [arXiv] [slides] [poster]
2017
Fast Distributed Approximation for TAP and 2-Edge-Connectivity
Keren Censor-Hillel, Michal Dory
OPODIS 2017
Best Paper Award
[paper] [arXiv] [slides]
Brief Announcement: Distributed Approximation for Tree Augmentation
Keren Censor-Hillel, Michal Dory
PODC 2017
Journal Papers
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs
Michal Dory, Mohsen Ghaffari, Saeed Ilchi
Distributed Computing, 2023
Exponentially Faster Shortest Paths in the Congested Clique
Michal Dory, Merav Parter
Journal of the ACM (JACM), 2022
Distributed Spanner Approximation
Keren Censor-Hillel, Michal Dory
SIAM Journal on Computing (SICOMP), 2021
Fast Approximate Shortest Paths in the Congested Clique
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
Distributed Computing, 2020
Fast Distributed Approximation for TAP and 2-Edge-Connectivity
Keren Censor-Hillel, Michal Dory
Distributed Computing, 2020
Thesis