Brief Announcement: Distributed Approximation for Tree Augmentation. - Keren Censor-Hillel; Michal Dory (PODC, 2017)

Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs. - Michal Dory (PODC, 2018)

Hardness of Distributed Optimization. - Nir Bachrach; Keren Censor-Hillel; Michal Dory; Yuval Efron; Dean Leitersdorf; Ami Paz (PODC, 2019)

Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph. - Michal Dory; Mohsen Ghaffari 001 (PODC, 2019)

PODC 2019 Review. - Naama Ben-David; Yi-Jun Chang; Michal Dory; Dean Leitersdorf (SIGACT News, 2019)

Fast distributed approximation for TAP and 2-edge-connectivity. - Keren Censor-Hillel; Michal Dory (Distributed Comput., 2020)

PODC 2020 Review. - Mirza Ahad Baig; Alkida Balliu; Peter Davies 001; Michal Dory (SIGACT News, 2020)

Distributed Network Design. - Michal Dory (2020)

Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. - Michal Dory; Orr Fischer; Seri Khoury; Dean Leitersdorf (PODC, 2021)

Fault-Tolerant Labeling and Compact Routing Schemes. - Michal Dory; Merav Parter (PODC, 2021)

Massively Parallel Algorithms for Distance Approximation and Spanners. - Amartya Shankha Biswas; Michal Dory; Mohsen Ghaffari 001; Slobodan Mitrovic; Yasamin Nazari (SPAA, 2021)

Distributed weighted min-cut in nearly-optimal time. - Michal Dory; Yuval Efron; Sagnik Mukhopadhyay; Danupon Nanongkai (STOC, 2021)

Fast approximate shortest paths in the congested clique. - Keren Censor-Hillel; Michal Dory; Janne H. Korhonen; Dean Leitersdorf (Distributed Comput., 2021)

Distributed Spanner Approximation. - Keren Censor-Hillel; Michal Dory (SIAM J. Comput., 2021)

A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph. - Michal Dory; Mohsen Ghaffari 001 (CoRR, 2022)

Exponentially Faster Shortest Paths in the Congested Clique. - Michal Dory; Merav Parter (J. ACM, 2022)

A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph. - Michal Dory; Mohsen Ghaffari 001 (SODA, 2023)

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. - Michal Dory; Sebastian Forster; Yasamin Nazari; Tijn de Vos (ICALP, 2024)

Improved All-Pairs Approximate Shortest Paths in Congested Clique. - Hong Duc Bui; Shashwat Chandra; Yi-Jun Chang; Michal Dory; Dean Leitersdorf (PODC, 2024)

Fast 2-Approximate All-Pairs Shortest Paths. - Michal Dory; Sebastian Forster; Yael Kirkpatrick; Yasamin Nazari; Virginia Vassilevska Williams; Tijn de Vos (SODA, 2024)

Fast Broadcast in Highly Connected Networks. - Shashwat Chandra; Yi-Jun Chang; Michal Dory; Mohsen Ghaffari 001; Dean Leitersdorf (SPAA, 2024)

Brief Announcement: Distributed Maximum Flow in Planar Graphs. - Yaseen Abd-Elhaleem; Michal Dory; Merav Parter; Oren Weimann (DISC, 2024)

Near-optimal distributed dominating set in bounded arboricity graphs. - Michal Dory; Mohsen Ghaffari 001; Saeed Ilchi (Distributed Comput., 2024)

Distributed Maximum Flow in Planar Graphs. - Yaseen Abd-Elhaleem; Michal Dory; Merav Parter; Oren Weimann (PODC, 2025)

Massively parallel algorithms for approximate shortest paths. - Michal Dory; Shaked Matar (Distributed Comput., 2025)