| Fast approximate shortest paths in the congested clique K Censor-Hillel, M Dory, JH Korhonen, D Leitersdorf Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 62 | 2019 |
| Hardness of distributed optimization N Bacrach, K Censor-Hillel, M Dory, Y Efron, D Leitersdorf, A Paz Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 49 | 2019 |
| Distributed weighted min-cut in nearly-optimal time M Dory, Y Efron, S Mukhopadhyay, D Nanongkai Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 28 | 2021 |
| Distributed spanner approximation K Censor-Hillel, M Dory Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018 | 27 | 2018 |
| Exponentially faster shortest paths in the congested clique M Dory, M Parter ACM Journal of the ACM (JACM) 69 (4), 1-42, 2022 | 26 | 2022 |
| Distributed approximation of minimum k-edge-connected spanning subgraphs M Dory Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018 | 20 | 2018 |
| Constant-round spanners and shortest paths in Congested Clique and MPC M Dory, O Fischer, S Khoury, D Leitersdorf Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021 | 17 | 2021 |
| Massively parallel algorithms for distance approximation and spanners AS Biswas, M Dory, M Ghaffari, S Mitrović, Y Nazari Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021 | 17 | 2021 |
| Improved distributed approximations for minimum-weight two-edge-connected spanning subgraph M Dory, M Ghaffari Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 15 | 2019 |
| Fast distributed approximation for TAP and 2-edge-connectivity K Censor-Hillel, M Dory Distributed Computing 33 (2), 145-168, 2020 | 12 | 2020 |
| Fault-tolerant labeling and compact routing schemes M Dory, M Parter Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021 | 10 | 2021 |
| Near-optimal distributed dominating set in bounded arboricity graphs M Dory, M Ghaffari, S Ilchi Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022 | 6 | 2022 |
| New tradeoffs for decremental approximate all-pairs shortest paths M Dory, S Forster, Y Nazari, T de Vos arXiv preprint arXiv:2211.01152, 2022 | 5 | 2022 |
| Fast 2-approximate all-pairs shortest paths M Dory, S Forster, Y Kirkpatrick, Y Nazari, VV Williams, T Vos Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 4 | 2024 |
| A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph M Dory, M Ghaffari Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 2 | 2023 |
| Distributed Network Design M Dory, K Censor-Hillel Computer Science Department, Technion, 2020 | 2 | 2020 |
| Distributed Maximum Flow in Planar Graphs Y Abd-Elhaleem, M Dory, M Parter, O Weimann arXiv preprint arXiv:2411.11718, 2024 | | 2024 |
| Massively Parallel Algorithms for Approximate Shortest Paths M Dory, S Matar Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and …, 2024 | | 2024 |
| Improved All-Pairs Approximate Shortest Paths in Congested Clique HD Bui, S Chandra, YJ Chang, M Dory, D Leitersdorf arXiv preprint arXiv:2405.02695, 2024 | | 2024 |
| Fast Broadcast in Highly Connected Networks S Chandra, YJ Chang, M Dory, M Ghaffari, D Leitersdorf arXiv preprint arXiv:2404.12930, 2024 | | 2024 |
