Michal Dory
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Near-optimal distributed dominating set in bounded arboricity graphs Distributed Computing | 2025-01-08 | Paper |
| Fast 2-approximate all-pairs shortest paths | 2024-11-28 | Paper |
| A nearly time-optimal distributed approximation of minimum cost \(k\)-edge-connected spanning subgraph | 2024-05-14 | Paper |
| Constant-Round Spanners and Shortest Paths in Congested Clique and MPC Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Fault-Tolerant Labeling and Compact Routing Schemes Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Distributed weighted min-cut in nearly-optimal time Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Distributed weighted min-cut in nearly-optimal time Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Exponentially Faster Shortest Paths in the Congested Clique Journal of the ACM | 2023-04-27 | Paper |
| Fast approximate shortest paths in the congested clique Distributed Computing | 2022-01-04 | Paper |
| Distributed spanner approximation SIAM Journal on Computing | 2021-06-29 | Paper |
| Exponentially Faster Shortest Paths in the Congested Clique Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| Fast Approximate Shortest Paths in the Congested Clique Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| Hardness of Distributed Optimization Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| Fast distributed approximation for TAP and 2-edge-connectivity | 2020-07-30 | Paper |
| Fast distributed approximation for TAP and 2-edge-connectivity Distributed Computing | 2020-04-23 | Paper |
| Fast distributed approximation for TAP and 2-edge-connectivity Distributed Computing | 2020-04-23 | Paper |
| Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Distributed Spanner Approximation Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Brief announcement: Distributed approximation for tree augmentation Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Research outcomes over time
This page was built for person: Michal Dory
