Sebastian F. Brandt

Available identifiers

zbMath Open brandt.sebastian-fMaRDI QIDQ1008402

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6126255	2024-04-09	Paper
Locally checkable problems in rooted trees	2024-03-26	Paper
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees	2024-03-26	Paper
The Randomized Local Computation Complexity of the Lovász Local Lemma	2024-03-26	Paper
Distributed Edge Coloring in Time Polylogarithmic in Δ	2024-03-26	Paper
The Landscape of Distributed Complexities on Trees and Beyond	2024-03-26	Paper
https://portal.mardi4nfdi.de/entity/Q6083432	2023-12-08	Paper
Distributed ∆-coloring plays hide-and-seek	2023-12-08	Paper
Locally checkable problems in rooted trees	2023-09-11	Paper
Lower Bounds for Maximal Matchings and Maximal Independent Sets	2022-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q5090898	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5090903	2022-07-21	Paper
Distributed Lower Bounds for Ruling Sets	2022-03-11	Paper
Almost global problems in the LOCAL model	2021-09-06	Paper
https://portal.mardi4nfdi.de/entity/Q5009566	2021-08-04	Paper
Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants	2021-03-15	Paper
How much does randomness help with locally checkable problems?	2021-03-15	Paper
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma	2021-03-15	Paper
Brief Announcement: Classification of Distributed Binary Labeling Problems	2021-03-15	Paper
A tight lower bound for semi-synchronous collaborative grid exploration	2021-01-22	Paper
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable	2021-01-20	Paper
An Automatic Speedup Theorem for Distributed Problems	2021-01-20	Paper
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma	2021-01-20	Paper
Massively Parallel Computation of Matching and MIS in Sparse Graphs	2021-01-20	Paper
Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory	2020-12-15	Paper
A tight lower bound for the capture time of the cops and robbers game	2020-09-03	Paper
Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs	2020-09-03	Paper
https://portal.mardi4nfdi.de/entity/Q5111413	2020-05-27	Paper
Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory	2020-03-03	Paper
Wireless evacuation on \(m\) rays with \(k\) searchers	2020-02-13	Paper
Approximating small balanced vertex separators in almost linear time	2019-09-10	Paper
Querying Log Data with Metric Temporal Logic	2018-09-06	Paper
Wireless evacuation on \(m\) rays with \(k\) searchers	2018-04-12	Paper
LCL Problems on Grids	2017-10-11	Paper
A lower bound for the distributed Lovász local lemma	2017-09-29	Paper
Approximating small balanced vertex separators in almost linear time	2017-09-22	Paper
Collaboration Without Communication: Evacuating Two Robots from a Disk	2017-07-21	Paper
Toehold DNA Languages are Regular (Extended Abstract)	2016-01-11	Paper
https://portal.mardi4nfdi.de/entity/Q3408134	2010-02-24	Paper
Distributed delays stabilize neural feedback systems	2009-03-27	Paper
Matching in Hybrid Terminologies	2008-05-15	Paper
Winner-take-all selection in a neural system with delayed feedback	2007-11-12	Paper
Large-D expansion from variational perturbation theory	2007-05-16	Paper
KI 2005: Advances in Artificial Intelligence	2006-11-13	Paper
Recursive calculation of effective potential and variational resummation	2005-06-30	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Sebastian F. Brandt