default search action
Sebastian Brandt 0002
Person information
- affiliation: CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
- affiliation (former): ETH Zürich, Switzerland
Other persons with the same name
- Sebastian Brandt — disambiguation page
- Sebastian Brandt 0001 — Siemens Corporate Technology, Munich, Germany (and 2 more)
- Sebastian Brandt 0003 — University of Duisburg-Essen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c42]Alkida Balliu
, Thomas Boudier
Tight Lower Bounds in the Supported LOCAL Model. PODC 2024: 95-105 - [c41]Alkida Balliu
Brief Announcement: Local Advice and Local Decompression. PODC 2024: 117-120 - [c40]Alkida Balliu
Completing the Node-Averaged Complexity Landscape of LCLs on Trees. PODC 2024: 369-379 - [i35]Alkida Balliu, Thomas Boudier, Sebastian Brandt, Dennis Olivetti:
Tight Lower Bounds in the Supported LOCAL Model. CoRR abs/2405.00825 (2024) - [i34]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid:
Completing the Node-Averaged Complexity Landscape of LCLs on Trees. CoRR abs/2405.01366 (2024) - [i33]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Krzysztof Nowicki, Dennis Olivetti, Eva Rotenberg, Jukka Suomela:
Local Advice and Local Decompression. CoRR abs/2405.04519 (2024) - [i32]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Joonatan Saarhelo:
Towards Fully Automatic Distributed Lower Bounds. CoRR abs/2410.20224 (2024) - 2023
- [j12]Alkida Balliu
Locally checkable problems in rooted trees. Distributed Comput. 36(3): 277-311 (2023) - [c39]Alkida Balliu
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs. SODA 2023: 2632-2676 - [c38]Alkida Balliu
On the Node-Averaged Complexity of Locally Checkable Problems on Trees. DISC 2023: 7:1-7:21 - [i31]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid:
On the Node-Averaged Complexity of Locally Checkable Problems on Trees. CoRR abs/2308.04251 (2023) - 2022
- [j11]Alkida Balliu
Distributed Lower Bounds for Ruling Sets. SIAM J. Comput. 51(1): 70-115 (2022) - [c37]Sebastian Brandt, Yi-Jun Chang
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. ITCS 2022: 29:1-29:26 - [c36]Alkida Balliu
Distributed Edge Coloring in Time Polylogarithmic in Δ. PODC 2022: 15-25 - [c35]Christoph Grunau
The Landscape of Distributed Complexities on Trees and Beyond. PODC 2022: 37-47 - [c34]Alkida Balliu
Distributed ∆-coloring plays hide-and-seek. STOC 2022: 464-477 - [c33]Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti
Efficient Classification of Locally Checkable Problems in Regular Trees. DISC 2022: 8:1-8:19 - [c32]Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti
Exponential Speedup over Locality in MPC with Optimal Memory. DISC 2022: 9:1-9:21 - [i30]Christoph Grunau, Václav Rozhon, Sebastian Brandt:
The Landscape of Distributed Complexities on Trees and Beyond. CoRR abs/2202.04724 (2022) - [i29]Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela:
Efficient Classification of Local Problems in Regular Trees. CoRR abs/2202.08544 (2022) - [i28]Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky:
Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees. CoRR abs/2204.09329 (2022) - [i27]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Distributed Edge Coloring in Time Polylogarithmic in Δ. CoRR abs/2206.00976 (2022) - [i26]Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto:
Exponential Speedup Over Locality in MPC with Optimal Memory. CoRR abs/2208.09453 (2022) - [i25]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs. CoRR abs/2211.01945 (2022) - 2021
- [j10]Alkida Balliu
Almost global problems in the LOCAL model. Distributed Comput. 34(4): 259-281 (2021) - [j9]Alkida Balliu
Lower Bounds for Maximal Matchings and Maximal Independent Sets. J. ACM 68(5): 39:1-39:30 (2021) - [j8]Sebastian Brandt
Breaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory. Theor. Comput. Sci. 849: 22-34 (2021) - [c31]Alkida Balliu
Locally Checkable Problems in Rooted Trees. PODC 2021: 263-272 - [c30]Alkida Balliu
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees. PODC 2021: 283-293 - [c29]Sebastian Brandt
The Randomized Local Computation Complexity of the Lovász Local Lemma. PODC 2021: 307-317 - [c28]Sebastian Brandt
Efficient Load-Balancing through Distributed Token Dropping. SPAA 2021: 129-139 - [c27]Sebastian Brandt
Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees. DISC 2021: 50:1-50:4 - [i24]Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko:
Locally Checkable Problems in Rooted Trees. CoRR abs/2102.09277 (2021) - [i23]Sebastian Brandt, Christoph Grunau, Václav Rozhon:
The randomized local computation complexity of the Lovász local lemma. CoRR abs/2103.16251 (2021) - [i22]Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky:
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. CoRR abs/2106.02066 (2021) - [i21]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees. CoRR abs/2106.02440 (2021) - [i20]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Distributed Δ-Coloring Plays Hide-and-Seek. CoRR abs/2110.00643 (2021) - [i19]Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, Zoltán Vidnyánszky:
On Homomorphism Graphs. CoRR abs/2111.03683 (2021) - [i18]Sebastian Brandt, Rustam Latypov, Jara Uitto:
Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees. CoRR abs/2112.09479 (2021) - 2020
- [j7]Sebastian Brandt
A tight lower bound for semi-synchronous collaborative grid exploration. Distributed Comput. 33(6): 471-484 (2020) - [j6]Sebastian Brandt
Wireless evacuation on m rays with k searchers. Theor. Comput. Sci. 811: 56-69 (2020) - [j5]Sebastian Brandt
A tight lower bound for the capture time of the Cops and Robbers game. Theor. Comput. Sci. 839: 143-163 (2020) - [j4]Sebastian Brandt
Online graph exploration on a restricted graph class: Optimal solutions for tadpole graphs. Theor. Comput. Sci. 839: 176-185 (2020) - [c26]Alkida Balliu
Distributed Lower Bounds for Ruling Sets. FOCS 2020: 365-376 - [c25]Sebastian Brandt
Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants. PODC 2020: 69-78 - [c24]Alkida Balliu
How much does randomness help with locally checkable problems? PODC 2020: 299-308 - [c23]Sebastian Brandt
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. PODC 2020: 329-338 - [c22]Alkida Balliu
Brief Announcement: Classification of Distributed Binary Labeling Problems. PODC 2020: 349-351 - [c21]Sebastian Brandt
Tight Bounds for Deterministic High-Dimensional Grid Exploration. DISC 2020: 13:1-13:16 - [c20]Alkida Balliu
Classification of Distributed Binary Labeling Problems. DISC 2020: 17:1-17:17 - [c19]Sebastian Brandt
Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping. DISC 2020: 40:1-40:3 - [i17]Sebastian Brandt, Dennis Olivetti:
Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants. CoRR abs/2002.08216 (2020) - [i16]Alkida Balliu, Sebastian Brandt, Dennis Olivetti:
Distributed Lower Bounds for Ruling Sets. CoRR abs/2004.08282 (2020) - [i15]Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto:
Efficient Load-Balancing through Distributed Token Dropping. CoRR abs/2005.07761 (2020) - [i14]Sebastian Brandt, Julian Portmann, Jara Uitto:
Tight Bounds for Deterministic High-Dimensional Grid Exploration. CoRR abs/2005.12623 (2020) - [i13]Sebastian Brandt, Christoph Grunau, Václav Rozhon:
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. CoRR abs/2006.04625 (2020)
2010 – 2019
- 2019
- [j3]Sebastian Brandt
Approximating Small Balanced Vertex Separators in Almost Linear Time. Algorithmica 81(10): 4070-4097 (2019) - [j2]Sebastian Brandt, Manuela Fischer, Jara Uitto:
SIROCCO 2019 Review. SIGACT News 50(4): 46-47 (2019) - [c18]Alkida Balliu
Lower Bounds for Maximal Matchings and Maximal Independent Sets. FOCS 2019: 481-497 - [c17]Alkida Balliu
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable. PODC 2019: 262-271 - [c16]Sebastian Brandt
An Automatic Speedup Theorem for Distributed Problems. PODC 2019: 379-388 - [c15]Sebastian Brandt
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. PODC 2019: 389-398 - [c14]Soheil Behnezhad, Sebastian Brandt
Massively Parallel Computation of Matching and MIS in Sparse Graphs. PODC 2019: 481-490 - [c13]Sebastian Brandt
Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory. SIROCCO 2019: 124-138 - [i12]Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, Jukka Suomela:
Lower bounds for maximal matchings and maximal independent sets. CoRR abs/1901.02441 (2019) - [i11]Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela:
How much does randomness help with locally checkable problems? CoRR abs/1902.06803 (2019) - [i10]Sebastian Brandt:
An Automatic Speedup Theorem for Distributed Problems. CoRR abs/1902.09958 (2019) - [i9]Sebastian Brandt, Klaus-Tycho Foerster, Jonathan Maurer, Roger Wattenhofer:
Online Graph Exploration on a Restricted Graph Class: Optimal Solutions for Tadpole Graphs. CoRR abs/1903.00581 (2019) - [i8]Sebastian Brandt, Yannic Maus, Jara Uitto:
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma. CoRR abs/1908.06270 (2019) - [i7]Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Classification of distributed binary labeling problems. CoRR abs/1911.13294 (2019) - 2018
- [c12]Sebastian Brandt, Seth Pettie, Jara Uitto:
Fine-grained Lower Bounds on Cops and Robbers. ESA 2018: 9:1-9:12 - [c11]Alkida Balliu
Almost Global Problems in the LOCAL Model. DISC 2018: 9:1-9:16 - [c10]Sebastian Brandt, Jara Uitto, Roger Wattenhofer:
A Tight Lower Bound for Semi-Synchronous Collaborative Grid Exploration. DISC 2018: 13:1-13:17 - [i6]Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela:
Almost Global Problems in the LOCAL Model. CoRR abs/1805.04776 (2018) - [i5]Sebastian Brandt, Manuela Fischer, Jara Uitto:
Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model. CoRR abs/1807.05374 (2018) - [i4]Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Mikaël Rabie, Jukka Suomela:
The distributed complexity of locally checkable problems on paths is decidable. CoRR abs/1811.01672 (2018) - 2017
- [j1]Sebastian Brandt
Augmenting flows for the consistent migration of multi-commodity single-destination flows in SDNs. Pervasive Mob. Comput. 36: 134-150 (2017) - [c9]Sebastian Brandt
Collaboration Without Communication: Evacuating Two Robots from a Disk. CIAC 2017: 104-115 - [c8]Sebastian Brandt, Yuval Emek, Jara Uitto, Roger Wattenhofer:
A Tight Lower Bound for the Capture Time of the Cops and Robbers Game. ICALP 2017: 82:1-82:13 - [c7]Sebastian Brandt
LCL Problems on Grids. PODC 2017: 101-110 - [c6]Sebastian Brandt
Wireless Evacuation on m Rays with k Searchers. SIROCCO 2017: 140-157 - [c5]Sebastian Brandt
Approximating Small Balanced Vertex Separators in Almost Linear Time. WADS 2017: 229-240 - [i3]Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski:
LCL problems on grids. CoRR abs/1702.05456 (2017) - [i2]Sebastian Brandt, Jara Uitto, Roger Wattenhofer:
Tight Bounds for Asynchronous Collaborative Grid Exploration. CoRR abs/1705.03834 (2017) - 2016
- [c4]Sebastian Brandt
Augmenting anycast network flows. ICDCN 2016: 24:1-24:10 - [c3]Sebastian Brandt
On consistent migration of flows in SDNs. INFOCOM 2016: 1-9 - [c2]Sebastian Brandt
A lower bound for the distributed Lovász local lemma. STOC 2016: 479-488 - 2015
- [c1]Sebastian Brandt
Toehold DNA Languages are Regular. ISAAC 2015: 780-790 - [i1]Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, Jara Uitto:
A Lower Bound for the Distributed Lovász Local Lemma. CoRR abs/1511.00900 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-30 00:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: