| How Asynchrony Affects Rumor Spreading Time G Giakkoupis, Y Nazari, P Woelfel | 36* | |
| On dynamic graph algorithms with predictions J Brand, S Forster, Y Nazari, A Polak Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 26 | 2024 |
| Fast Deterministic Fully Dynamic Distance Approximation J van den Brand, S Forster, Y Nazari Proceedings of FOCS 2022, 2022 | 19 | 2022 |
| Massively Parallel Approximate Distance Sketches M Dinitz, Y Nazari Proceedings of Conference on Principles of Distributed Systems (OPODIS), 2018 | 19* | 2018 |
| Massively parallel algorithms for distance approximation and spanners AS Biswas, M Dory, M Ghaffari, S Mitrović, Y Nazari Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021 | 18 | 2021 |
| Bootstrapping Dynamic Distance Oracles S Forster, G Goranci, Y Nazari, A Skarlatos the 31st Annual European Symposium on Algorithms (ESA), 2023 | 14 | 2023 |
| Near-Optimal Decremental Hopsets with Applications J Łącki, Y Nazari Proceedings of 49th International Colloquium on Automata, Languages and …, 2021 | 14* | 2021 |
| Dynamic algorithms for k-center on graphs E Cruciani, S Forster, G Goranci, Y Nazari, A Skarlatos Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 13 | 2024 |
| Vertex fault-tolerant emulators G Bodwin, M Dinitz, Y Nazari Proceedings of ITCS 2022, 2021 | 10 | 2021 |
| Lasserre integrality gaps for graph spanners and related problems M Dinitz, Y Nazari, Z Zhang Proceedings of Workshop on Approximation and Online Algorithms (WAOA), 2019 | 9 | 2019 |
| Fast 2-approximate all-pairs shortest paths M Dory, S Forster, Y Kirkpatrick, Y Nazari, VV Williams, T Vos Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 8 | 2024 |
| New tradeoffs for decremental approximate all-pairs shortest paths M Dory, S Forster, Y Nazari, T de Vos arXiv preprint arXiv:2211.01152, 2022 | 8 | 2022 |
| Deterministic incremental APSP with polylogarithmic update time and stretch S Forster, Y Nazari, M Probst Gutenberg Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1173-1186, 2023 | 7 | 2023 |
| Distributed Distance-Bounded Network Design Through Distributed Convex Programming M Dinitz, Y Nazari Proceedings of Conference on Principles of Distributed Systems (OPODIS), 2017 | 6* | 2017 |
| Epic Fail: Emulators can tolerate polynomially many edge faults for free G Bodwin, M Dinitz, Y Nazari Proceedings of ITCS 2023, 2022 | 4 | 2022 |
| Online Allocation and Display Ads Optimization with Surplus Supply M Abolhassani, H Esfandiari, Y Nazari, B Sivan, Y Teng, C Thomas International Conference on Web and Internet Economics, 41-59, 2022 | 2 | 2022 |
| Sparse Hopsets in Congested Clique Y Nazari Proceedings of Conference on Principles of Distributed Systems (OPODIS), 2019 | 2 | 2019 |
| Approximation Algorithms for Optimal Hopsets M Dinitz, A Koranteng, Y Nazari arXiv preprint arXiv:2502.06522, 2025 | 1 | 2025 |
| Analysis of asynchronous and synchronous rumor spreading protocols Y Nazari Master’s thesis, University of Calgary. http://hdl. handle. net/11023/3136, 2016 | 1 | 2016 |
| Greedy Algorithms for Shortcut Sets and Hopsets B Bals, J Blikstad, G Bodwin, D Dadush, S Forster, Y Nazari arXiv preprint arXiv:2511.20111, 2025 | | 2025 |
Michael DinitzAssociate Professor, Johns Hopkins UniversityVerified email at cs.jhu.edu
