Sebastian F. Brandt

From MaRDI portal
Revision as of 07:05, 13 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Sebastian F. Brandt to Sebastian F. Brandt: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1008402

Available identifiers

zbMath Open brandt.sebastian-fMaRDI QIDQ1008402

List of research outcomes





PublicationDate of PublicationType
Distributed maximal matching and maximal independent set on hypergraphs2024-05-14Paper
https://portal.mardi4nfdi.de/entity/Q61262552024-04-09Paper
Locally checkable problems in rooted trees2024-03-26Paper
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees2024-03-26Paper
The Randomized Local Computation Complexity of the Lovász Local Lemma2024-03-26Paper
Distributed Edge Coloring in Time Polylogarithmic in Δ2024-03-26Paper
The Landscape of Distributed Complexities on Trees and Beyond2024-03-26Paper
https://portal.mardi4nfdi.de/entity/Q60834322023-12-08Paper
Distributed ∆-coloring plays hide-and-seek2023-12-08Paper
Tight bounds for deterministic high-dimensional grid exploration2023-11-02Paper
Classification of distributed binary labeling problems2023-11-02Paper
Brief announcement: Efficient load-balancing through distributed token dropping2023-11-02Paper
Locally checkable problems in rooted trees2023-09-11Paper
Lower Bounds for Maximal Matchings and Maximal Independent Sets2022-12-08Paper
Almost global problems in the LOCAL model2022-07-21Paper
A tight lower bound for semi-synchronous collaborative grid exploration2022-07-21Paper
Deterministic Distributed algorithms and Descriptive Combinatorics on \Delta-regular trees2022-04-20Paper
Distributed Lower Bounds for Ruling Sets2022-03-11Paper
On Homomorphism Graphs2021-11-05Paper
Almost global problems in the LOCAL model2021-09-06Paper
Fine-grained Lower Bounds on Cops and Robbers2021-08-04Paper
Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants2021-03-15Paper
How much does randomness help with locally checkable problems?2021-03-15Paper
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma2021-03-15Paper
Brief Announcement: Classification of Distributed Binary Labeling Problems2021-03-15Paper
A tight lower bound for semi-synchronous collaborative grid exploration2021-01-22Paper
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable2021-01-20Paper
An Automatic Speedup Theorem for Distributed Problems2021-01-20Paper
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma2021-01-20Paper
Massively Parallel Computation of Matching and MIS in Sparse Graphs2021-01-20Paper
Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory2020-12-15Paper
A tight lower bound for the capture time of the cops and robbers game2020-09-03Paper
Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs2020-09-03Paper
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lov\'asz Local Lemma2020-06-08Paper
A Tight Lower Bound for the Capture Time of the Cops and Robbers Game2020-05-27Paper
Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory2020-03-03Paper
Wireless evacuation on \(m\) rays with \(k\) searchers2020-02-13Paper
Approximating small balanced vertex separators in almost linear time2019-09-10Paper
Querying Log Data with Metric Temporal Logic2018-09-06Paper
Wireless evacuation on \(m\) rays with \(k\) searchers2018-04-12Paper
LCL Problems on Grids2017-10-11Paper
A lower bound for the distributed Lovász local lemma2017-09-29Paper
Approximating small balanced vertex separators in almost linear time2017-09-22Paper
Collaboration Without Communication: Evacuating Two Robots from a Disk2017-07-21Paper
Toehold DNA Languages are Regular (Extended Abstract)2016-01-11Paper
https://portal.mardi4nfdi.de/entity/Q34081342010-02-24Paper
Distributed delays stabilize neural feedback systems2009-03-27Paper
Matching in Hybrid Terminologies2008-05-15Paper
Winner-take-all selection in a neural system with delayed feedback2007-11-12Paper
Large-D expansion from variational perturbation theory2007-05-16Paper
KI 2005: Advances in Artificial Intelligence2006-11-13Paper
Recursive calculation of effective potential and variational resummation2005-06-30Paper

Research outcomes over time

This page was built for person: Sebastian F. Brandt