| 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 Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 100 | 2019 |
| Sirocco: silent rotors by acoustic optimisation JG Schepers, A Curvers, S Oerlemans, K Braun, T Lutz, A Herrig, ... 2nd international meeting on wind turbine noise, 2007 | 94 | 2007 |
| Sublogarithmic distributed algorithms for Lov\'asz local lemma, and the complexity hierarchy M Fischer, M Ghaffari arXiv preprint arXiv:1705.04840, 2017 | 88 | 2017 |
| Deterministic distributed edge-coloring via hypergraph maximal matching M Fischer, M Ghaffari, F Kuhn 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 86 | 2017 |
| Improved deterministic distributed matching via rounding M Fischer Distributed Computing 33 (3), 279-291, 2020 | 75 | 2020 |
| Tight analysis of parallel randomized greedy MIS M Fischer, A Noever ACM Transactions on Algorithms (TALG) 16 (1), 1-13, 2019 | 65 | 2019 |
| Massively parallel computation of matching and MIS in sparse graphs S Behnezhad, S Brandt, M Derakhshan, M Fischer, MT Hajiaghayi, ... Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 52 | 2019 |
| Deterministic (1+𝜀)-approximate maximum matching with poly(1/𝜀) passes in the semi-streaming model and beyond M Fischer, S Mitrović, J Uitto Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 35 | 2022 |
| A simple parallel and distributed sampling technique: Local glauber dynamics M Fischer, M Ghaffari arXiv preprint arXiv:1802.06676, 2018 | 27 | 2018 |
| Matching and MIS for uniformly sparse graphs in the low-memory MPC model S Brandt, M Fischer, J Uitto arXiv preprint arXiv:1807.05374, 2018 | 25 | 2018 |
| Fast distributed Brooks' theorem M Fischer, MM Halldórsson, Y Maus Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 14 | 2023 |
| Extreme k-center clustering MH Bateni, H Esfandiari, M Fischer, V Mirrokni Proceedings of the AAAI Conference on Artificial Intelligence 35 (5), 3941-3949, 2021 | 14 | 2021 |
| Triangle resilience of the square of a Hamilton cycle in random graphs M Fischer, N Škorić, A Steger, M Trujić Journal of Combinatorial Theory, Series B 152, 171-220, 2022 | 12 | 2022 |
| Breaking the Linear-Memory Barrier in: Fast on Trees with Strongly Sublinear Memory S Brandt, M Fischer, J Uitto International Colloquium on Structural Information and Communication …, 2019 | 12 | 2019 |
| Breaking the linear-memory barrier in MPC: Fast MIS on trees with nϵ memory per machine S Brandt, M Fischer, J Uitto arXiv preprint arXiv:1802.06748, 2018 | 12 | 2018 |
| Exponential speedup over locality in MPC with optimal memory A Balliu, S Brandt, M Fischer, R Latypov, Y Maus, D Olivetti, J Uitto arXiv preprint arXiv:2208.09453, 2022 | 10 | 2022 |
| Deterministic distributed matching: Simpler, faster, better M Fischer, M Ghaffari arXiv preprint arXiv:1703.00900, 2017 | 10 | 2017 |
| Reliable communication using unreliable channel Y Afek, H Attyia, A Fekete, M Fischer, N Lynch, Y Mansour, DW Wang, ... J ACM, 1991 | 7 | 1991 |
| Improved deterministic connectivity in massively parallel computation M Fischer, J Giliberti, C Grunau arXiv preprint arXiv:2206.01568, 2022 | 6 | 2022 |
| Simple graph coloring algorithms for congested clique and massively parallel computation M Fischer, M Ghaffari, J Uitto arXiv preprint arXiv:1808.08419, 2018 | 5 | 2018 |
