| A lower bound for the distributed Lovász local lemma S Brandt, O Fischer, J Hirvonen, B Keller, T Lempiäinen, J Rybicki, ... Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 145 | 2016 |
| Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation M Ghaffari, J Uitto Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 117 | 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 Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 98 | 2019 |
| The complexity of distributed edge coloring with small palettes YJ Chang, Q He, W Li, S Pettie, J Uitto Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 88* | 2018 |
| How many ants does it take to find the food? Y Emek, T Langner, D Stolz, J Uitto, R Wattenhofer Theoretical Computer Science 608, 255-267, 2015 | 74 | 2015 |
| Solving the ANTS problem with asynchronous finite state machines Y Emek, T Langner, J Uitto, R Wattenhofer Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014 | 69* | 2014 |
| 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 | 65* | 2019 |
| Conditional hardness results for massively parallel computation from distributed lower bounds M Ghaffari, F Kuhn, J Uitto 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 62 | 2019 |
| A local 2-approximation algorithm for the vertex cover problem M Åstrand, P Floréen, V Polishchuk, J Rybicki, J Suomela, J Uitto International symposium on distributed computing, 191-205, 2009 | 59 | 2009 |
| Deterministic distributed edge-coloring with fewer colors M Ghaffari, F Kuhn, Y Maus, J Uitto Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 50 | 2018 |
| 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 | 37* | 2022 |
| Exploring an infinite space with finite memory scouts L Cohen, Y Emek, O Louidor, J Uitto Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 32 | 2017 |
| Breaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory S Brandt, M Fischer, J Uitto Theoretical Computer Science 849, 22-34, 2021 | 28* | 2021 |
| Improved distributed degree splitting and edge coloring M Ghaffari, J Hirvonen, F Kuhn, Y Maus, J Suomela, J Uitto Distributed Computing 33 (3), 293-310, 2020 | 28 | 2020 |
| Spareeye: enhancing the safety of inattentionally blind smartphone users KT Foerster, A Gross, N Hail, J Uitto, R Wattenhofer Proceedings of the 13th international conference on mobile and ubiquitous …, 2014 | 25 | 2014 |
| A tight lower bound for semi-synchronous collaborative grid exploration S Brandt, J Uitto, R Wattenhofer Distributed Computing 33, 471-484, 2020 | 24 | 2020 |
| Fault-tolerant ANTS T Langner, J Uitto, D Stolz, R Wattenhofer International Symposium on Distributed Computing, 31-45, 2014 | 24 | 2014 |
| Local algorithms in (weakly) coloured graphs, 2010 M Åstrand, V Polishchuk, J Rybicki, J Suomela, J Uitto Manuscript, 0 | 21* | |
| Massively parallel correlation clustering in bounded arboricity graphs M Cambus, D Choo, H Miikonen, J Uitto arXiv preprint arXiv:2102.11660, 2021 | 17 | 2021 |
| A tight lower bound for the capture time of the cops and robbers game S Brandt, Y Emek, J Uitto, R Wattenhofer Theoretical Computer Science 839, 143-163, 2020 | 16 | 2020 |
Roger WattenhoferETH ZurichVerified email at ethz.ch
