Michal Dory

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 41

Top Topics

Parallel Algorithm

Highly Connected

Top Venues

Distributed Comput.

Publications

Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf
Fast Broadcast in Highly Connected Networks. CoRR (2024)
Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf
Fast Broadcast in Highly Connected Networks. SPAA (2024)
Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf
Improved All-Pairs Approximate Shortest Paths in Congested Clique. PODC (2024)
Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. ICALP (2024)
Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf
Improved All-Pairs Approximate Shortest Paths in Congested Clique. CoRR (2024)
Michal Dory, Shaked Matar
Massively Parallel Algorithms for Approximate Shortest Paths. SPAA (2024)
Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos
Fast 2-Approximate All-Pairs Shortest Paths. SODA (2024)
Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos
Fast 2-Approximate All-Pairs Shortest Paths. CoRR (2023)
Michal Dory, Mohsen Ghaffari
-Edge-Connected Spanning Subgraph. SODA (2023)
Michal Dory, Mohsen Ghaffari, Saeed Ilchi
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs. CoRR (2022)
Michal Dory, Mohsen Ghaffari
A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph. CoRR (2022)
Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. CoRR (2022)
Michal Dory, Merav Parter
Exponentially Faster Shortest Paths in the Congested Clique. J. ACM 69 (4) (2022)
Michal Dory, Mohsen Ghaffari, Saeed Ilchi
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs. PODC (2022)
Michal Dory, Merav Parter
Fault-Tolerant Labeling and Compact Routing Schemes. CoRR (2021)
Michal Dory, Merav Parter
Fault-Tolerant Labeling and Compact Routing Schemes. PODC (2021)
Keren Censor-Hillel, Michal Dory
Distributed Spanner Approximation. SIAM J. Comput. 50 (3) (2021)
Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf
Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. PODC (2021)
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
Fast approximate shortest paths in the congested clique. Distributed Comput. 34 (6) (2021)
Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai
Distributed weighted min-cut in nearly-optimal time. STOC (2021)
Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari
Massively Parallel Algorithms for Distance Approximation and Spanners. SPAA (2021)
Michal Dory, Merav Parter
Exponentially Faster Shortest Paths in the Congested Clique. PODC (2020)
Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari
Massively Parallel Algorithms for Distance Approximation and Spanners. CoRR (2020)
Mirza Ahad Baig, Alkida Balliu, Peter Davies, Michal Dory
PODC 2020 Review. SIGACT News 51 (4) (2020)
Michal Dory, Merav Parter
Exponentially Faster Shortest Paths in the Congested Clique. CoRR (2020)
Keren Censor-Hillel, Michal Dory
Fast distributed approximation for TAP and 2-edge-connectivity. Distributed Comput. 33 (2) (2020)
Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai
Distributed Weighted Min-Cut in Nearly-Optimal Time. CoRR (2020)
Michal Dory, Mohsen Ghaffari
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph. CoRR (2019)
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
Fast Approximate Shortest Paths in the Congested Clique. PODC (2019)
Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz
Hardness of Distributed Optimization. PODC (2019)
Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz
Hardness of Distributed Optimization. CoRR (2019)
Michal Dory, Mohsen Ghaffari
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph. PODC (2019)
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
Fast Approximate Shortest Paths in the Congested Clique. CoRR (2019)
Naama Ben-David, Yi-Jun Chang, Michal Dory, Dean Leitersdorf
PODC 2019 Review. SIGACT News 50 (4) (2019)
Michal Dory
Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs. CoRR (2018)
Keren Censor-Hillel, Michal Dory
Distributed Spanner Approximation. CoRR (2018)
Keren Censor-Hillel, Michal Dory
Distributed Spanner Approximation. PODC (2018)
Michal Dory
Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs. PODC (2018)
Keren Censor-Hillel, Michal Dory
Fast Distributed Approximation for TAP and 2-Edge-Connectivity. OPODIS (2017)
Keren Censor-Hillel, Michal Dory
Fast Distributed Approximation for TAP and 2-Edge-Connectivity. CoRR (2017)
Keren Censor-Hillel, Michal Dory
Brief Announcement: Distributed Approximation for Tree Augmentation. PODC (2017)