20172024

Research activity per year

Fingerprint

Dive into the research topics where Michal Dory is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
  • 1 Similar Profiles

Collaborations and top research areas from the last five years

Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
  • Fast 2-Approximate All-Pairs Shortest Paths

    Dory, M., Forster, S., Kirkpatrick, Y., Nazari, Y., Williams, V. V. & de Vos, T., 2024, p. 4728-4757. 30 p.

    Research output: Contribution to conferencePaperpeer-review

    Open Access
  • 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 proceedingConference contributionpeer-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 proceedingConference contributionpeer-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 proceedingConference contributionpeer-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 proceedingConference contributionpeer-review