Michal Dory

View Scopus Profile

Michal Dory

Former affiliation
 https://orcid.org/0000-0002-8565-9642
20172024

Research activity per year

Filter
Conference contribution

Search results

  • 2024

    Brief Announcement: Distributed Maximum Flow in Planar Graphs

    Abd-Elhaleem, Y., Dory, M., Parter, M. & Weimann, O., 24 Oct 2024, 38th International Symposium on Distributed Computing, DISC 2024. Alistarh, D. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 40. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 319).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Fast Broadcast in Highly Connected Networks

    Chandra, S., Chang, Y. J., Dory, M., Ghaffari, M. & Leitersdorf, D., 17 Jun 2024, SPAA 2024 - Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 331-343 13 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • Improved All-Pairs Approximate Shortest Paths in Congested Clique

    Bui, H. D., Chandra, S., Chang, Y. J., Dory, M. & Leitersdorf, D., 17 Jun 2024, PODC 2024 - Proceedings of the 2024 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 391-400 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • Massively parallel algorithms for approximate shortest paths

    Dory, M. & Matar, S., 17 Jun 2024, SPAA 2024 - Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 415-426 12 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths

    Dory, M., Forster, S., Nazari, Y. & de Vos, T., Jul 2024, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024. Bringmann, K., Grohe, M., Puppis, G. & Svensson, O. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 58. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 297).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2023

    A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph

    Dory, M. & Ghaffari, M., 2023, 34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023. Association for Computing Machinery, p. 4296-4334 39 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2023-January).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2022

    Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs

    Dory, M., Ghaffari, M. & Ilchi, S., 20 Jul 2022, PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 292-300 9 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
  • 2021

    Constant-Round Spanners and Shortest Paths in Congested Clique and MPC

    Dory, M., Fischer, O., Khoury, S. & Leitersdorf, D., 21 Jul 2021, PODC 2021 - Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 223-233 11 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Distributed weighted min-cut in nearly-optimal time

    Dory, M., Efron, Y., Mukhopadhyay, S. & Nanongkai, D., 15 Jun 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, p. 1144-1153 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • Fault-Tolerant Labeling and Compact Routing Schemes

    Dory, M. & Parter, M., 21 Jul 2021, PODC 2021 - Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 445-455 11 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • Massively parallel algorithms for distance approximation and spanners

    Biswas, A. S., Dory, M., Ghaffari, M., Mitrović, S. & Nazari, Y., 6 Jul 2021, SPAA 2021 - Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 118-128 11 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
  • 2020

    Exponentially Faster Shortest Paths in the Congested Clique

    Dory, M. & Parter, M., 31 Jul 2020, PODC 2020 - Proceedings of the 39th Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 59-68 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
  • 2019

    Fast approximate shortest paths in the congested clique

    Censor-Hillel, K., Dory, M., Korhonen, J. H. & Leitersdorf, D., 16 Jul 2019, PODC 2019 - Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 74-83 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • Hardness of distributed optimization

    Bacrach, N., Censor-Hillel, K., Dory, M., Efron, Y., Leitersdorf, D. & Paz, A., 16 Jul 2019, PODC 2019 - Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 238-247 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • Improved distributed approximations for minimum-weight two-edge-connected spanning subgraph

    Dory, M. & Ghaffari, M., 16 Jul 2019, PODC 2019 - Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 521-530 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
  • 2018

    Distributed approximation of minimum k-edge-connected spanning subgraphs

    Dory, M., 23 Jul 2018, PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 149-158 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • Distributed spanner approximation

    Censor-Hillel, K. & Dory, M., 23 Jul 2018, PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 139-148 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • Fast distributed approximation for TAP and 2-edge-connectivity

    Censor-Hillel, K. & Dory, M., 1 Mar 2018, 21st International Conference on Principles of Distributed Systems, OPODIS 2017. Aspnes, J., Leitao, J., Bessani, A. & Felber, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 21. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 95).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2017

    Brief announcement: Distributed approximation for tree augmentation

    Censor-Hillel, K. & Dory, M., 26 Jul 2017, PODC 2017 - Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 199-201 3 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; vol. Part F129314).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review