Michal Dory

According to our database, Michal Dory authored at least 20 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Fast 2-Approximate All-Pairs Shortest Paths.

Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

A Nearly Time-Optimal Distributed Approximation of Minimum Cost <i>k</i>-Edge-Connected Spanning Subgraph.

Michal Dory, Mohsen Ghaffari

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Exponentially Faster Shortest Paths in the Congested Clique.

Michal Dory, Merav Parter

J. ACM, 2022

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

Michal Dory, Mohsen Ghaffari

CoRR, 2022

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths.

Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos

CoRR, 2022

Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs.

Michal Dory, Mohsen Ghaffari, Saeed Ilchi

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021

Distributed Spanner Approximation.

Keren Censor-Hillel, Michal Dory

SIAM J. Comput., 2021

Fast approximate shortest paths in the congested clique.

Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf

Distributed Comput., 2021

Distributed weighted min-cut in nearly-optimal time.

Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Massively Parallel Algorithms for Distance Approximation and Spanners.

Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Fault-Tolerant Labeling and Compact Routing Schemes.

Michal Dory, Merav Parter

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

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

Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020

Distributed Network Design.

Michal Dory

PhD thesis, 2020

PODC 2020 Review.

Mirza Ahad Baig, Alkida Balliu, Peter Davies, Michal Dory

SIGACT News, 2020

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

Keren Censor-Hillel, Michal Dory

Distributed Comput., 2020

2019

PODC 2019 Review.

Naama Ben-David, Yi-Jun Chang, Michal Dory, Dean Leitersdorf

SIGACT News, 2019

Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph.

Michal Dory, Mohsen Ghaffari

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Hardness of Distributed Optimization.

Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018

Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs.

Michal Dory

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017

Brief Announcement: Distributed Approximation for Tree Augmentation.

Keren Censor-Hillel, Michal Dory

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017