Toehold DNA Languages are Regular. - Sebastian Brandt 002; Nicolas Mattia; Jochen Seidel; Roger Wattenhofer (ISAAC, 2015)

Augmenting anycast network flows. - Sebastian Brandt 002; Klaus-Tycho Förster; Roger Wattenhofer (ICDCN, 2016)

On consistent migration of flows in SDNs. - Sebastian Brandt 002; Klaus-Tycho Förster; Roger Wattenhofer (INFOCOM, 2016)

A lower bound for the distributed Lovász local lemma. - Sebastian Brandt 002; Orr Fischer; Juho Hirvonen; Barbara Keller; Tuomo Lempiäinen; Joel Rybicki; Jukka Suomela; Jara Uitto (STOC, 2016)

Collaboration Without Communication: Evacuating Two Robots from a Disk. - Sebastian Brandt 002; Felix Laufenberg; Yuezhou Lv; David Stolz; Roger Wattenhofer (CIAC, 2017)

LCL Problems on Grids. - Sebastian Brandt 002; Juho Hirvonen; Janne H. Korhonen; Tuomo Lempiäinen; Patric R. J. Östergård; Christopher Purcell; Joel Rybicki; Jukka Suomela; Przemyslaw Uznanski (PODC, 2017)

Wireless Evacuation on m Rays with k Searchers. - Sebastian Brandt 002; Klaus-Tycho Foerster; Benjamin Richner; Roger Wattenhofer (SIROCCO, 2017)

Tight Bounds for Asynchronous Collaborative Grid Exploration. - Sebastian Brandt 002; Jara Uitto; Roger Wattenhofer (CoRR, 2017)

Augmenting flows for the consistent migration of multi-commodity single-destination flows in SDNs. - Sebastian Brandt 002; Klaus-Tycho Foerster; Roger Wattenhofer (Pervasive Mob. Comput., 2017)

Fine-grained Lower Bounds on Cops and Robbers. - Sebastian Brandt 002; Seth Pettie; Jara Uitto (ESA, 2018)

Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model. - Sebastian Brandt 002; Manuela Fischer; Jara Uitto (CoRR, 2018)

The Distributed Complexity of Locally Checkable Problems on Paths is Decidable. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Mikaël Rabie; Jukka Suomela (PODC, 2019)

Massively Parallel Computation of Matching and MIS in Sparse Graphs. - Soheil Behnezhad; Sebastian Brandt 002; Mahsa Derakhshan; Manuela Fischer; MohammadTaghi Hajiaghayi; Richard M. Karp; Jara Uitto (PODC, 2019)

An Automatic Speedup Theorem for Distributed Problems. - Sebastian Brandt 002 (PODC, 2019)

A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. - Sebastian Brandt 002; Yannic Maus; Jara Uitto (PODC, 2019)

Approximating Small Balanced Vertex Separators in Almost Linear Time. - Sebastian Brandt 002; Roger Wattenhofer (Algorithmica, 2019)

SIROCCO 2019 Review. - Sebastian Brandt 002; Manuela Fischer; Jara Uitto (SIGACT News, 2019)

Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. - Sebastian Brandt 002; Christoph Grunau; Václav Rozhon (PODC, 2020)

Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants. - Sebastian Brandt 002; Dennis Olivetti (PODC, 2020)

Brief Announcement: Classification of Distributed Binary Labeling Problems. - Alkida Balliu; Sebastian Brandt 002; Yuval Efron; Juho Hirvonen; Yannic Maus; Dennis Olivetti; Jukka Suomela (PODC, 2020)

How much does randomness help with locally checkable problems? - Alkida Balliu; Sebastian Brandt 002; Dennis Olivetti; Jukka Suomela (PODC, 2020)

Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping. - Sebastian Brandt 002; Barbara Keller; Joel Rybicki; Jukka Suomela; Jara Uitto (DISC, 2020)

Tight Bounds for Deterministic High-Dimensional Grid Exploration. - Sebastian Brandt 002; Julian Portmann; Jara Uitto (DISC, 2020)

Classification of Distributed Binary Labeling Problems. - Alkida Balliu; Sebastian Brandt 002; Yuval Efron; Juho Hirvonen; Yannic Maus; Dennis Olivetti; Jukka Suomela (DISC, 2020)

A tight lower bound for semi-synchronous collaborative grid exploration. - Sebastian Brandt 002; Jara Uitto; Roger Wattenhofer (Distributed Comput., 2020)

A tight lower bound for the capture time of the Cops and Robbers game. - Sebastian Brandt 002; Yuval Emek; Jara Uitto; Roger Wattenhofer (Theor. Comput. Sci., 2020)

Online graph exploration on a restricted graph class: Optimal solutions for tadpole graphs. - Sebastian Brandt 002; Klaus-Tycho Foerster; Jonathan Maurer; Roger Wattenhofer (Theor. Comput. Sci., 2020)

Wireless evacuation on m rays with k searchers. - Sebastian Brandt 002; Klaus-Tycho Foerster; Benjamin Richner; Roger Wattenhofer (Theor. Comput. Sci., 2020)

The Randomized Local Computation Complexity of the Lovász Local Lemma. - Sebastian Brandt 002; Christoph Grunau; Václav Rozhon (PODC, 2021)

Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti (PODC, 2021)

Locally Checkable Problems in Rooted Trees. - Alkida Balliu; Sebastian Brandt 002; Dennis Olivetti; Jan Studený; Jukka Suomela; Aleksandr Tereshchenko (PODC, 2021)

Efficient Load-Balancing through Distributed Token Dropping. - Sebastian Brandt 002; Barbara Keller; Joel Rybicki; Jukka Suomela; Jara Uitto (SPAA, 2021)

Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees. - Sebastian Brandt 002; Rustam Latypov; Jara Uitto (DISC, 2021)

Distributed Δ-Coloring Plays Hide-and-Seek. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti (CoRR, 2021)

On Homomorphism Graphs. - Sebastian Brandt 002; Yi-Jun Chang; Jan Grebík; Christoph Grunau; Václav Rozhon; Zoltán Vidnyánszky (CoRR, 2021)

Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees. - Sebastian Brandt 002; Rustam Latypov; Jara Uitto (CoRR, 2021)

Almost global problems in the LOCAL model. - Alkida Balliu; Sebastian Brandt 002; Dennis Olivetti; Jukka Suomela (Distributed Comput., 2021)

Lower Bounds for Maximal Matchings and Maximal Independent Sets. - Alkida Balliu; Sebastian Brandt 002; Juho Hirvonen; Dennis Olivetti; Mikaël Rabie; Jukka Suomela (J. ACM, 2021)

Breaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory. - Sebastian Brandt 002; Manuela Fischer; Jara Uitto (Theor. Comput. Sci., 2021)

Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. - Sebastian Brandt 002; Yi-Jun Chang; Jan Grebík; Christoph Grunau; Václav Rozhon; Zoltán Vidnyánszky (ITCS, 2022)

Distributed Edge Coloring in Time Polylogarithmic in Δ. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti (PODC, 2022)

The Landscape of Distributed Complexities on Trees and Beyond. - Christoph Grunau; Václav Rozhon; Sebastian Brandt 002 (PODC, 2022)

Distributed ∆-coloring plays hide-and-seek. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti (STOC, 2022)

Efficient Classification of Locally Checkable Problems in Regular Trees. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Jan Studený; Jukka Suomela (DISC, 2022)

Exponential Speedup over Locality in MPC with Optimal Memory. - Alkida Balliu; Sebastian Brandt 002; Manuela Fischer; Rustam Latypov; Yannic Maus; Dennis Olivetti; Jara Uitto (DISC, 2022)

Efficient Classification of Local Problems in Regular Trees. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Jan Studený; Jukka Suomela (CoRR, 2022)

Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees. - Sebastian Brandt 002; Yi-Jun Chang; Jan Grebík; Christoph Grunau; Václav Rozhon; Zoltán Vidnyánszky (CoRR, 2022)

Distributed Lower Bounds for Ruling Sets. - Alkida Balliu; Sebastian Brandt 002; Dennis Olivetti (SIAM J. Comput., 2022)

Distributed Maximal Matching and Maximal Independent Set on Hypergraphs. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti (SODA, 2023)

On the Node-Averaged Complexity of Locally Checkable Problems on Trees. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti; Gustav Schmid (DISC, 2023)

Locally checkable problems in rooted trees. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Jan Studený; Jukka Suomela; Aleksandr Tereshchenko (Distributed Comput., 2023)

Brief Announcement: Local Advice and Local Decompression. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Krzysztof Nowicki 002; Dennis Olivetti; Eva Rotenberg; Jukka Suomela (PODC, 2024)

Completing the Node-Averaged Complexity Landscape of LCLs on Trees. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti; Gustav Schmid (PODC, 2024)

Tight Lower Bounds in the Supported LOCAL Model. - Alkida Balliu; Thomas Boudier; Sebastian Brandt 002; Dennis Olivetti (PODC, 2024)

Local Advice and Local Decompression. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Krzysztof Nowicki 002; Dennis Olivetti; Eva Rotenberg; Jukka Suomela (CoRR, 2024)

Towards Fully Automatic Distributed Lower Bounds. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti; Joonatan Saarhelo (CoRR, 2024)

Towards Optimal Deterministic LOCAL Algorithms on Trees. - Sebastian Brandt 002; Ananth Narayanan (PODC, 2025)

On the Locality of Hall's Theorem. - Sebastian Brandt 002; Yannic Maus; Ananth Narayanan; Florian Schager; Jara Uitto (SODA, 2025)

Distributed Quantum Advantage for Local Problems. - Alkida Balliu; Sebastian Brandt 002; Xavier Coiteux-Roy; Francesco D'Amore 001; Massimo Equi; François Le Gall; Henrik Lievonen; Augusto Modanese; Dennis Olivetti; Marc-Olivier Renou; Jukka Suomela; Lucas Tendick; et al. (STOC, 2025)

Faster Distributed Δ-Coloring via Ruling Subgraphs. - Yann Bourreau; Sebastian Brandt 002; Alexandre Nolin (STOC, 2025)

Faster Distributed Δ-Coloring via a Reduction to MIS. - Yann Bourreau; Sebastian Brandt 002; Alexandre Nolin (CoRR, 2025)