| 2026 | SPAA | Deterministic Distance Approximation in MPC via Improved Hitting Sets. | Kyungjin Cho, Michal Dory, Yannic Maus, Tijn de Vos |
| 2026 | SIROCCO | A Simple Distributed Deterministic Planar Separator. | Yaseen Abd-Elhaleem, Michal Dory, Oren Weimann |
| 2025 | PODC | Distributed Maximum Flow in Planar Graphs. | Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann |
| 2024 | ICALP | New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. | Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos |
| 2024 | PODC | Improved All-Pairs Approximate Shortest Paths in Congested Clique. | Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf |
| 2024 | SODA | Fast 2-Approximate All-Pairs Shortest Paths. | Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos |
| 2024 | SPAA | Fast Broadcast in Highly Connected Networks. | Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf |
| 2024 | SPAA | Massively Parallel Algorithms for Approximate Shortest Paths. | Michal Dory, Shaked Matar |
| 2023 | SODA | A Nearly Time-Optimal Distributed Approximation of Minimum Cost | Michal Dory, Mohsen Ghaffari |
| 2022 | PODC | Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs. | Michal Dory, Mohsen Ghaffari, Saeed Ilchi |
| 2021 | PODC | Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. | Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf |
| 2021 | PODC | Fault-Tolerant Labeling and Compact Routing Schemes. | Michal Dory, Merav Parter |
| 2021 | STOC | Distributed weighted min-cut in nearly-optimal time. | Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2021 | SPAA | Massively Parallel Algorithms for Distance Approximation and Spanners. | Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari |
| 2020 | PODC | Exponentially Faster Shortest Paths in the Congested Clique. | Michal Dory, Merav Parter |
| 2019 | PODC | Hardness of Distributed Optimization. | Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz |
| 2019 | PODC | Fast Approximate Shortest Paths in the Congested Clique. | Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf |
| 2019 | PODC | Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph. | Michal Dory, Mohsen Ghaffari |
| 2018 | PODC | Distributed Spanner Approximation. | Keren Censor-Hillel, Michal Dory |
| 2018 | PODC | Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs. | Michal Dory |
| 2017 | OPODIS | Fast Distributed Approximation for TAP and 2-Edge-Connectivity. | Keren Censor-Hillel, Michal Dory |
| 2017 | PODC | Brief Announcement: Distributed Approximation for Tree Augmentation. | Keren Censor-Hillel, Michal Dory |