Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastian Brandt 0002
- > Home > Persons > Sebastian Brandt 0002
Publications
- 2023
[j12]Alkida Balliu
, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko:
Locally checkable problems in rooted trees. Distributed Comput. 36(3): 277-311 (2023)- [c39]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs. SODA 2023: 2632-2676 - [c38]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid:
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, Sebastian Brandt, Dennis Olivetti:
Distributed Lower Bounds for Ruling Sets. SIAM J. Comput. 51(1): 70-115 (2022) - [c36]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Distributed Edge Coloring in Time Polylogarithmic in Δ. PODC 2022: 15-25 - [c34]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Distributed ∆-coloring plays hide-and-seek. STOC 2022: 464-477 - [c33]Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela:
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, Jara Uitto:
Exponential Speedup over Locality in MPC with Optimal Memory. DISC 2022: 9:1-9:21 - [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) - [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, Sebastian Brandt, Dennis Olivetti, Jukka Suomela:
Almost global problems in the LOCAL model. Distributed Comput. 34(4): 259-281 (2021) - [j9]Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, Jukka Suomela:
Lower Bounds for Maximal Matchings and Maximal Independent Sets. J. ACM 68(5): 39:1-39:30 (2021) - [c31]Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko:
Locally Checkable Problems in Rooted Trees. PODC 2021: 263-272 - [c30]Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti:
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees. PODC 2021: 283-293 - [i24]Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko:
Locally Checkable Problems in Rooted Trees. CoRR abs/2102.09277 (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) - 2020
- [c26]Alkida Balliu, Sebastian Brandt, Dennis Olivetti:
Distributed Lower Bounds for Ruling Sets. FOCS 2020: 365-376 - [c25]Sebastian Brandt, Dennis Olivetti:
Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants. PODC 2020: 69-78 - [c24]Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela:
How much does randomness help with locally checkable problems? PODC 2020: 299-308 - [c22]Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Brief Announcement: Classification of Distributed Binary Labeling Problems. PODC 2020: 349-351 - [c20]Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Classification of Distributed Binary Labeling Problems. DISC 2020: 17:1-17:17 - [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) - 2019
- [c18]Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, Jukka Suomela:
Lower Bounds for Maximal Matchings and Maximal Independent Sets. FOCS 2019: 481-497 - [c17]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. PODC 2019: 262-271 - [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) - [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
- [c11]Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela:
Almost Global Problems in the LOCAL Model. DISC 2018: 9:1-9:16 - [i6]Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela:
Almost Global Problems in the LOCAL Model. CoRR abs/1805.04776 (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)
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 2023-11-13 23:31 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:
