Follow
Sebastian Brandt
Sebastian Brandt
CISPA Helmholtz Center for Information Security
Verified email at cispa.de - Homepage
Title
Cited by
Cited by
Year
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
1342016
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
1232016
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
1032021
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
682017
An automatic speedup theorem for distributed problems
S Brandt
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
592019
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
492019
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
482019
Almost global problems in the LOCAL model
A Balliu, S Brandt, D Olivetti, J Suomela
Distributed Computing 34, 259-281, 2021
452021
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
422017
Distributed lower bounds for ruling sets
A Balliu, S Brandt, D Olivetti
SIAM Journal on Computing 51 (1), 70-115, 2022
362022
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
292019
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
282021
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
282020
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
262020
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
242021
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
242018
A tight lower bound for semi-synchronous collaborative grid exploration
S Brandt, J Uitto, R Wattenhofer
Distributed Computing 33, 471-484, 2020
202020
Wireless evacuation on m rays with k searchers
S Brandt, KT Foerster, B Richner, R Wattenhofer
Theoretical Computer Science 811, 56-69, 2020
192020
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
182017
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
152020
The system can't perform the operation now. Try again later.
Articles 1–20