Michal Dory - RankMe

51 papers A* 16A 1B 4Journal 29

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Simple Distributed Deterministic Planar Separator. CoRR Yaseen Abd-Elhaleem, Michal Dory, Oren Weimann
2026	J	`jnl`	Constant-round spanners and shortest paths in congested clique and MPC. Distributed Comput. Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf
2026	J	`jnl`	Improved all-pairs approximate shortest paths in congested clique. Distributed Comput. Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf
2025	A*	`conf`	Distributed Maximum Flow in Planar Graphs. PODC Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann
2025	J	`jnl`	Massively parallel algorithms for approximate shortest paths. Distributed Comput. Michal Dory, Shaked Matar
2024	A	`conf`	Brief Announcement: Distributed Maximum Flow in Planar Graphs. DISC Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann
2024	J	`jnl`	Distributed Maximum Flow in Planar Graphs. CoRR Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, Oren Weimann
2024	A*	`conf`	Fast 2-Approximate All-Pairs Shortest Paths. SODA Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos
2024	B	`conf`	Fast Broadcast in Highly Connected Networks. SPAA Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf
2024	J	`jnl`	Fast Broadcast in Highly Connected Networks. CoRR Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf
2024	A*	`conf`	Improved All-Pairs Approximate Shortest Paths in Congested Clique. PODC Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf
2024	J	`jnl`	Improved All-Pairs Approximate Shortest Paths in Congested Clique. CoRR Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf
2024	B	`conf`	Massively Parallel Algorithms for Approximate Shortest Paths. SPAA Michal Dory, Shaked Matar
2024	J	`jnl`	Massively Parallel Algorithms for Approximate Shortest Paths. CoRR Michal Dory, Shaked Matar
2024	J	`jnl`	Near-optimal distributed dominating set in bounded arboricity graphs. Distributed Comput. Michal Dory, Mohsen Ghaffari, Saeed Ilchi
2024	A*	`conf`	New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. ICALP Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos
2023	A*	`conf`	A Nearly Time-Optimal Distributed Approximation of Minimum Cost SODA Michal Dory, Mohsen Ghaffari
2023	J	`jnl`	Fast 2-Approximate All-Pairs Shortest Paths. CoRR Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos
2022	J	`jnl`	A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph. CoRR Michal Dory, Mohsen Ghaffari
2022	J	`jnl`	Exponentially Faster Shortest Paths in the Congested Clique. J. ACM Michal Dory, Merav Parter
2022	A*	`conf`	Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs. PODC Michal Dory, Mohsen Ghaffari, Saeed Ilchi
2022	J	`jnl`	Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs. CoRR Michal Dory, Mohsen Ghaffari, Saeed Ilchi
2022	J	`jnl`	New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. CoRR Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos
2021	A*	`conf`	Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. PODC Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf
2021	J	`jnl`	Distributed Spanner Approximation. SIAM J. Comput. Keren Censor-Hillel, Michal Dory
2021	A*	`conf`	Distributed weighted min-cut in nearly-optimal time. STOC Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai
2021	J	`jnl`	Fast approximate shortest paths in the congested clique. Distributed Comput. Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
2021	A*	`conf`	Fault-Tolerant Labeling and Compact Routing Schemes. PODC Michal Dory, Merav Parter
2021	J	`jnl`	Fault-Tolerant Labeling and Compact Routing Schemes. CoRR Michal Dory, Merav Parter
2021	B	`conf`	Massively Parallel Algorithms for Distance Approximation and Spanners. SPAA Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari
2020	—	`—`	Distributed Network Design. Michal Dory
2020	J	`jnl`	Distributed Weighted Min-Cut in Nearly-Optimal Time. CoRR Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai
2020	A*	`conf`	Exponentially Faster Shortest Paths in the Congested Clique. PODC Michal Dory, Merav Parter
2020	J	`jnl`	Exponentially Faster Shortest Paths in the Congested Clique. CoRR Michal Dory, Merav Parter
2020	J	`jnl`	Fast distributed approximation for TAP and 2-edge-connectivity. Distributed Comput. Keren Censor-Hillel, Michal Dory
2020	J	`jnl`	Massively Parallel Algorithms for Distance Approximation and Spanners. CoRR Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari
2020	J	`jnl`	PODC 2020 Review. SIGACT News Mirza Ahad Baig, Alkida Balliu, Peter Davies, Michal Dory
2019	A*	`conf`	Fast Approximate Shortest Paths in the Congested Clique. PODC Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
2019	J	`jnl`	Fast Approximate Shortest Paths in the Congested Clique. CoRR Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
2019	A*	`conf`	Hardness of Distributed Optimization. PODC Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz
2019	J	`jnl`	Hardness of Distributed Optimization. CoRR Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz
2019	A*	`conf`	Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph. PODC Michal Dory, Mohsen Ghaffari
2019	J	`jnl`	Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph. CoRR Michal Dory, Mohsen Ghaffari
2019	J	`jnl`	PODC 2019 Review. SIGACT News Naama Ben-David, Yi-Jun Chang, Michal Dory, Dean Leitersdorf
2018	A*	`conf`	Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs. PODC Michal Dory
2018	J	`jnl`	Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs. CoRR Michal Dory
2018	A*	`conf`	Distributed Spanner Approximation. PODC Keren Censor-Hillel, Michal Dory
2018	J	`jnl`	Distributed Spanner Approximation. CoRR Keren Censor-Hillel, Michal Dory
2017	A*	`conf`	Brief Announcement: Distributed Approximation for Tree Augmentation. PODC Keren Censor-Hillel, Michal Dory
2017	B	`conf`	Fast Distributed Approximation for TAP and 2-Edge-Connectivity. OPODIS Keren Censor-Hillel, Michal Dory
2017	J	`jnl`	Fast Distributed Approximation for TAP and 2-Edge-Connectivity. CoRR Keren Censor-Hillel, Michal Dory