Sebastian Brandt

Helmholtz Center for Information Security — Germany

Computer Science · Physical Sciences

24h-index3.0kcitations185works0.52yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(72), Semantic Web and Ontologies(48), Optimization and Search Problems(42), Advanced Graph Theory Research(30), Advanced Database Systems and Queries(27)

Publications185 total

Faster Distributed \(\Delta\)-Coloring via a Reduction to MIS
Society for Industrial and Applied Mathematics eBooks·2026
On the Complexity of Distributed Edge Coloring and Orientation Problems
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2026Open Access
A Post-Quantum Lower Bound for the Distributed Lovasz Local Lemma
Society for Industrial and Applied Mathematics eBooks·2026
On the Universality of Round Elimination Fixed Points
Society for Industrial and Applied Mathematics eBooks·2026
On the Universality of Round Elimination Fixed Points
arXiv (Cornell University)·2025Open Access
A Post-Quantum Lower Bound for the Distributed Lovász Local Lemma
arXiv (Cornell University)·2025Open Access
Faster Distributed $Δ$-Coloring via a Reduction to MIS
arXiv (Cornell University)·2025Open Access
Faster Distributed Δ-Coloring via Ruling Subgraphs
2025· 1 cited
Distributed Quantum Advantage for Local Problems
2025· 1 citedOpen Access
Towards Optimal Deterministic LOCAL Algorithms on Trees
2025Open Access
Towards Optimal Deterministic LOCAL Algorithms on Trees
arXiv (Cornell University)·2025· 1 citedOpen Access
Faster Distributed $Δ$-Coloring via Ruling Subgraphs
arXiv (Cornell University)·2025Open Access
Exponential speedup over locality in MPC with optimal memory
Distributed Computing·2025Open Access
On the Locality of Hall's Theorem
arXiv (Cornell University)·2025Open Access
On the Locality of Hall’s Theorem
Society for Industrial and Applied Mathematics eBooks·2025· 1 citedOpen Access
Towards Fully Automatic Distributed Lower Bounds
arXiv (Cornell University)·2024· 1 citedOpen Access
Brief Announcement: Local Advice and Local Decompression
2024· 3 citedOpen Access
Completing the Node-Averaged Complexity Landscape of LCLs on Trees
2024· 2 citedOpen Access
Tight Lower Bounds in the Supported LOCAL Model
2024· 1 citedOpen Access
Distributed Computation with Local Advice
arXiv (Cornell University)·2024Open Access
page 1 of 10Next →

Frequent Co-authors

Evgeny Kharlamov(10), Ian Horrocks(8), Christian Neuenstadt(7), Özgür Lütfü Özçep(7), Steffen Lamparter(7), Roger Wattenhofer(7), Jukka Suomela(6), Jara Uitto(6), Ahmet Soylu(6), Dmitriy Zheleznyakov(6), Ernesto Jiménez-Ruiz(6), Guohui Xiao(6), Dennis Olivetti(6), Juho Hirvonen(5), Theofilos Mailis(5), Mikhail Roshchin(5), Christoforos Svingos(5), Yannis Ioannidis(5), Ralf Möller(5), Yannis Kotidis(5)