| An improved distributed algorithm for maximal independent set M Ghaffari ACM-SIAM symposium on Discrete algorithms (SODA) 2016, 270-277, 2016 | 228 | 2016 |
| Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization V Rozhoň, M Ghaffari ACM SIGACT Symposium on Theory of Computing (STOC) 2020, 2020 | 185 | 2020 |
| On the complexity of local distributed graph problems M Ghaffari, F Kuhn, Y Maus ACM SIGACT Symposium on Theory of Computing (STOC) 2017, 784-797, 2017 | 138 | 2017 |
| Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover M Ghaffari, T Gouleakis, C Konrad, S Mitrović, R Rubinfeld ACM Symposium on Principles of Distributed Computing (PODC) 2018, 129-138, 2018 | 137 | 2018 |
| On derandomizing local distributed algorithms M Ghaffari, DG Harris, F Kuhn IEEE Symposium on Foundations of Computer Science (FOCS) 2018, 662-673, 2018 | 126 | 2018 |
| Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation M Ghaffari, J Uitto ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019, 1636-1653, 2019 | 111 | 2019 |
| The Complexity of (Δ+ 1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation YJ Chang, M Fischer, M Ghaffari, J Uitto, Y Zheng ACM Symposium on Principles of Distributed Computing (PODC) 2019, 471-480, 2019 | 98 | 2019 |
| Distributed algorithms for planar networks II: Low-congestion shortcuts, mst, and min-cut M Ghaffari, B Haeupler ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016, 202-219, 2016 | 97 | 2016 |
| Distributed minimum cut approximation M Ghaffari, F Kuhn International Symposium on Distributed Computing (DISC) 2013, 1-15, 2013 | 96 | 2013 |
| Distributed degree splitting, edge coloring, and orientations M Ghaffari, HH Su ACM-SIAM Symposium on Discrete Algorithms (SODA) 2017, 2505-2523, 2017 | 93 | 2017 |
| MST in log-star rounds of congested clique M Ghaffari, M Parter ACM Symposium on Principles of Distributed Computing (PODC) 2016, 19-28, 2016 | 88 | 2016 |
| Sublogarithmic Distributed Algorithms for Lov\'asz Local lemma, and the Complexity Hierarchy M Fischer, M Ghaffari International Symposium on Distributed Computing (DISC) 2017, 2017 | 83 | 2017 |
| Optimal error rates for interactive coding II: Efficiency and list decoding M Ghaffari, B Haeupler IEEE Symposium on Foundations of Computer Science (FOCS) 2014, 394-403, 2014 | 81 | 2014 |
| Improved deterministic network decomposition M Ghaffari, C Grunau, V Rozhoň Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 76 | 2021 |
| Near optimal leader election in multi-hop radio networks M Ghaffari, B Haeupler ACM-SIAM Symposium on Discrete Algorithms (SODA) 2013, 748-766, 2013 | 76 | 2013 |
| Deterministic distributed edge-coloring via hypergraph maximal matching M Fischer, M Ghaffari, F Kuhn Foundations of Computer Science (FOCS), 2017 IEEE 58th Annual Symposium on …, 2017 | 75 | 2017 |
| Optimal error rates for interactive coding I: Adaptivity and other settings M Ghaffari, B Haeupler, M Sudan ACM Symposium on Theory of Computing (STOC) 2014, 794-803, 2014 | 72 | 2014 |
| Near-Optimal Distributed Maximum Flow M Ghaffari, A Karrenbauer, F Kuhn, C Lenzen, B Patt-Shamir SIAM Journal on Computing (SICOMP) 47 (6), 2078-2117, 2018 | 71 | 2018 |
| Randomized broadcast in radio networks with collision detection M Ghaffari, B Haeupler, M Khabbazian Distributed Computing 28 (6), 407-422, 2015 | 70 | 2015 |
| A polylogarithmic gossip algorithm for plurality consensus M Ghaffari, M Parter ACM Symposium on Principles of Distributed Computing (PODC) 2016, 117-126, 2016 | 66 | 2016 |
