default search action
Michal Dory
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c19]Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos:
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. ICALP 2024: 58:1-58:19 - [c18]Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf:
Improved All-Pairs Approximate Shortest Paths in Congested Clique. PODC 2024: 391-400 - [c17]Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos:
Fast 2-Approximate All-Pairs Shortest Paths. SODA 2024: 4728-4757 - [c16]Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf:
Fast Broadcast in Highly Connected Networks. SPAA 2024: 331-343 - [c15]Michal Dory, Shaked Matar:
Massively Parallel Algorithms for Approximate Shortest Paths. SPAA 2024: 415-426 - [i16]Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf:
Fast Broadcast in Highly Connected Networks. CoRR abs/2404.12930 (2024) - [i15]Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf:
Improved All-Pairs Approximate Shortest Paths in Congested Clique. CoRR abs/2405.02695 (2024) - 2023
- [c14]Michal Dory, Mohsen Ghaffari:
A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph. SODA 2023: 4296-4334 - [i14]Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos:
Fast 2-Approximate All-Pairs Shortest Paths. CoRR abs/2307.09258 (2023) - 2022
- [j6]Michal Dory, Merav Parter:
Exponentially Faster Shortest Paths in the Congested Clique. J. ACM 69(4): 29:1-29:42 (2022) - [c13]Michal Dory, Mohsen Ghaffari, Saeed Ilchi:
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs. PODC 2022: 292-300 - [i13]Michal Dory, Mohsen Ghaffari, Saeed Ilchi:
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs. CoRR abs/2206.05174 (2022) - [i12]Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos:
New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. CoRR abs/2211.01152 (2022) - [i11]Michal Dory, Mohsen Ghaffari:
A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph. CoRR abs/2211.04994 (2022) - 2021
- [j5]Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf:
Fast approximate shortest paths in the congested clique. Distributed Comput. 34(6): 463-487 (2021) - [j4]Keren Censor-Hillel, Michal Dory:
Distributed Spanner Approximation. SIAM J. Comput. 50(3): 1103-1147 (2021) - [c12]Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf:
Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. PODC 2021: 223-233 - [c11]Michal Dory, Merav Parter:
Fault-Tolerant Labeling and Compact Routing Schemes. PODC 2021: 445-455 - [c10]Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari:
Massively Parallel Algorithms for Distance Approximation and Spanners. SPAA 2021: 118-128 - [c9]Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Distributed weighted min-cut in nearly-optimal time. STOC 2021: 1144-1153 - [i10]Michal Dory, Merav Parter:
Fault-Tolerant Labeling and Compact Routing Schemes. CoRR abs/2106.00374 (2021) - 2020
- [b1]Michal Dory:
Distributed Network Design. Technion - Israel Institute of Technology, Israel, 2020 - [j3]Keren Censor-Hillel, Michal Dory:
Fast distributed approximation for TAP and 2-edge-connectivity. Distributed Comput. 33(2): 145-168 (2020) - [j2]Mirza Ahad Baig, Alkida Balliu, Peter Davies, Michal Dory:
PODC 2020 Review. SIGACT News 51(4): 75-81 (2020) - [c8]Michal Dory, Merav Parter:
Exponentially Faster Shortest Paths in the Congested Clique. PODC 2020: 59-68 - [i9]Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari:
Massively Parallel Algorithms for Distance Approximation and Spanners. CoRR abs/2003.01254 (2020) - [i8]Michal Dory, Merav Parter:
Exponentially Faster Shortest Paths in the Congested Clique. CoRR abs/2003.03058 (2020) - [i7]Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Distributed Weighted Min-Cut in Nearly-Optimal Time. CoRR abs/2004.09129 (2020)
2010 – 2019
- 2019
- [j1]Naama Ben-David, Yi-Jun Chang, Michal Dory, Dean Leitersdorf:
PODC 2019 Review. SIGACT News 50(4): 33-45 (2019) - [c7]Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf:
Fast Approximate Shortest Paths in the Congested Clique. PODC 2019: 74-83 - [c6]Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz:
Hardness of Distributed Optimization. PODC 2019: 238-247 - [c5]Michal Dory, Mohsen Ghaffari:
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph. PODC 2019: 521-530 - [i6]Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf:
Fast Approximate Shortest Paths in the Congested Clique. CoRR abs/1903.05956 (2019) - [i5]Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz:
Hardness of Distributed Optimization. CoRR abs/1905.10284 (2019) - [i4]Michal Dory, Mohsen Ghaffari:
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph. CoRR abs/1905.10833 (2019) - 2018
- [c4]Keren Censor-Hillel, Michal Dory:
Distributed Spanner Approximation. PODC 2018: 139-148 - [c3]Michal Dory:
Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs. PODC 2018: 149-158 - [i3]Keren Censor-Hillel, Michal Dory:
Distributed Spanner Approximation. CoRR abs/1802.03160 (2018) - [i2]Michal Dory:
Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs. CoRR abs/1805.07764 (2018) - 2017
- [c2]Keren Censor-Hillel, Michal Dory:
Fast Distributed Approximation for TAP and 2-Edge-Connectivity. OPODIS 2017: 21:1-21:20 - [c1]Keren Censor-Hillel, Michal Dory:
Brief Announcement: Distributed Approximation for Tree Augmentation. PODC 2017: 199-201 - [i1]Keren Censor-Hillel, Michal Dory:
Fast Distributed Approximation for TAP and 2-Edge-Connectivity. CoRR abs/1711.03359 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint