Michal Dory

Orcid: 0000-0002-8565-9642

According to our database1, Michal Dory authored at least 25 papers between 2017 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Distributed Maximum Flow in Planar Graphs.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

2024
Brief Announcement: Distributed Maximum Flow in Planar Graphs.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Massively Parallel Algorithms for Approximate Shortest Paths.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Fast Broadcast in Highly Connected Networks.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Fast 2-Approximate All-Pairs Shortest Paths.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Improved All-Pairs Approximate Shortest Paths in Congested Clique.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
A Nearly Time-Optimal Distributed Approximation of Minimum Cost <i>k</i>-Edge-Connected Spanning Subgraph.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph.
CoRR, 2022

Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021
Distributed weighted min-cut in nearly-optimal time.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Massively Parallel Algorithms for Distance Approximation and Spanners.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Fault-Tolerant Labeling and Compact Routing Schemes.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Constant-Round Spanners and Shortest Paths in Congested Clique and MPC.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020
Distributed Network Design.
PhD thesis, 2020

PODC 2020 Review.
SIGACT News, 2020

Exponentially Faster Shortest Paths in the Congested Clique.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019
PODC 2019 Review.
SIGACT News, 2019

Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Fast Approximate Shortest Paths in the Congested Clique.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Hardness of Distributed Optimization.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018
Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Distributed Spanner Approximation.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
Brief Announcement: Distributed Approximation for Tree Augmentation.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Fast Distributed Approximation for TAP and 2-Edge-Connectivity.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017


  Loading...