Conference Papers
Exponentially Faster Shortest Paths in the Congested Clique
Michal Dory, Merav Parter
PODC 2020
Best Paper Award
[paper][arXiv][slides][video]
Fast Approximate Shortest Paths in the Congested Clique
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
PODC 2019
Best Student Paper Award
[paper][arXiv][slides]
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph
Michal Dory, Mohsen Ghaffari
PODC 2019
[paper][arXiv][slides]
Hardness of Distributed Optimization
Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz
PODC 2019
[paper][arXiv]
Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs
Michal Dory
PODC 2018
[paper] [arXiv] [slides]
Distributed Spanner Approximation
Keren Censor-Hillel, Michal Dory
PODC 2018
[paper] [arXiv] [slides] [poster]
Fast Distributed Approximation for TAP and 2-Edge-Connectivity
Keren Censor-Hillel, Michal Dory
OPODIS 2017
Best Paper Award
[paper] [arXiv] [slides]
Brief Announcement: Distributed Approximation for Tree Augmentation
Keren Censor-Hillel, Michal Dory
PODC 2017
Journal Papers
Fast Approximate Shortest Paths in the Congested Clique
Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
Accepted to Distributed Computing, 2020
Fast Distributed Approximation for TAP and 2-Edge-Connectivity
Keren Censor-Hillel, Michal Dory
Distributed Computing, 2020