| 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 | 133 | 2016 |
| On consistent migration of flows in SDNs S Brandt, KT Förster, R Wattenhofer IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer …, 2016 | 123 | 2016 |
| Lower bounds for maximal matchings and maximal independent sets A Balliu, S Brandt, J Hirvonen, D Olivetti, M Rabie, J Suomela Journal of the ACM (JACM) 68 (5), 1-30, 2021 | 103 | 2021 |
| LCL problems on grids S Brandt, J Hirvonen, JH Korhonen, T Lempiäinen, PRJ Östergård, ... Proceedings of the ACM Symposium on Principles of Distributed Computing, 101-110, 2017 | 67 | 2017 |
| An automatic speedup theorem for distributed problems S Brandt Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 58 | 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 | 49 | 2019 |
| Classification of distributed binary labeling problems A Balliu, S Brandt, Y Efron, J Hirvonen, Y Maus, D Olivetti, J Suomela arXiv preprint arXiv:1911.13294, 2019 | 48 | 2019 |
| Almost global problems in the LOCAL model A Balliu, S Brandt, D Olivetti, J Suomela Distributed Computing 34, 259-281, 2021 | 44 | 2021 |
| Collaboration without communication: Evacuating two robots from a disk S Brandt, F Laufenberg, Y Lv, D Stolz, R Wattenhofer Algorithms and Complexity: 10th International Conference, CIAC 2017, Athens …, 2017 | 44 | 2017 |
| Distributed lower bounds for ruling sets A Balliu, S Brandt, D Olivetti SIAM Journal on Computing 51 (1), 70-115, 2022 | 35 | 2022 |
| The distributed complexity of locally checkable problems on paths is decidable A Balliu, S Brandt, YJ Chang, D Olivetti, M Rabie, J Suomela Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 29 | 2019 |
| Local problems on trees from the perspectives of distributed algorithms, finitary factors, and descriptive combinatorics S Brandt, YJ Chang, J Grebík, C Grunau, V Rozhoň, Z Vidnyánszky arXiv preprint arXiv:2106.02066, 2021 | 28 | 2021 |
| How much does randomness help with locally checkable problems? A Balliu, S Brandt, D Olivetti, J Suomela Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020 | 28 | 2020 |
| Truly tight-in-Δ bounds for bipartite maximal matching and variants S Brandt, D Olivetti Proceedings of the 39th Symposium on Principles of Distributed Computing, 69-78, 2020 | 25 | 2020 |
| Locally checkable problems in rooted trees A Balliu, S Brandt, D Olivetti, J Studený, J Suomela, A Tereshchenko Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021 | 24 | 2021 |
| 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 | 24 | 2018 |
| Wireless evacuation on m rays with k searchers S Brandt, KT Foerster, B Richner, R Wattenhofer Theoretical Computer Science 811, 56-69, 2020 | 23 | 2020 |
| A tight lower bound for semi-synchronous collaborative grid exploration S Brandt, J Uitto, R Wattenhofer Distributed Computing 33, 471-484, 2020 | 21 | 2020 |
| Distributed∆-coloring plays hide-and-seek A Balliu, S Brandt, F Kuhn, D Olivetti Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 18 | 2022 |
| Augmenting flows for the consistent migration of multi-commodity single-destination flows in sdns S Brandt, KT Foerster, R Wattenhofer Pervasive and Mobile Computing 36, 134-150, 2017 | 18 | 2017 |
Alkida BalliuGran Sasso Science Institute在 gssi.it 的电子邮件经过验证
