The following pages link to Sebastian F. Brandt (Q1008402):
Displaying 41 items.
- Distributed delays stabilize neural feedback systems (Q1008404) (← links)
- (Q1742762) (redirect page) (← links)
- Almost global problems in the LOCAL model (Q1981631) (← links)
- A tight lower bound for the capture time of the cops and robbers game (Q2196569) (← links)
- Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs (Q2196574) (← links)
- Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory (Q2215966) (← links)
- A tight lower bound for semi-synchronous collaborative grid exploration (Q2220396) (← links)
- Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory (Q2303285) (← links)
- Winner-take-all selection in a neural system with delayed feedback (Q2460453) (← links)
- Recursive calculation of effective potential and variational resummation (Q3024225) (← links)
- (Q3408134) (← links)
- Large-D expansion from variational perturbation theory (Q3438664) (← links)
- Toehold DNA Languages are Regular (Extended Abstract) (Q3459916) (← links)
- Matching in Hybrid Terminologies (Q3498464) (← links)
- Querying Log Data with Metric Temporal Logic (Q4585057) (← links)
- Fine-grained Lower Bounds on Cops and Robbers (Q5009566) (← links)
- Lower Bounds for Maximal Matchings and Maximal Independent Sets (Q5056427) (← links)
- Almost global problems in the LOCAL model (Q5090898) (← links)
- A tight lower bound for semi-synchronous collaborative grid exploration (Q5090903) (← links)
- A Tight Lower Bound for the Capture Time of the Cops and Robbers Game (Q5111413) (← links)
- The Distributed Complexity of Locally Checkable Problems on Paths is Decidable (Q5145218) (← links)
- An Automatic Speedup Theorem for Distributed Problems (Q5145238) (← links)
- A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma (Q5145239) (← links)
- Massively Parallel Computation of Matching and MIS in Sparse Graphs (Q5145260) (← links)
- Collaboration Without Communication: Evacuating Two Robots from a Disk (Q5283360) (← links)
- A lower bound for the distributed Lovász local lemma (Q5361853) (← links)
- LCL Problems on Grids (Q5368949) (← links)
- Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants (Q5855209) (← links)
- How much does randomness help with locally checkable problems? (Q5855249) (← links)
- Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma (Q5855252) (← links)
- Brief Announcement: Classification of Distributed Binary Labeling Problems (Q5855255) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
- KI 2005: Advances in Artificial Intelligence (Q5897739) (← links)
- Wireless evacuation on \(m\) rays with \(k\) searchers (Q5916001) (← links)
- Wireless evacuation on \(m\) rays with \(k\) searchers (Q5919422) (← links)
- Approximating small balanced vertex separators in almost linear time (Q5919618) (← links)
- Approximating small balanced vertex separators in almost linear time (Q5920101) (← links)
- (Q6083432) (← links)
- Locally checkable problems in rooted trees (Q6096035) (← links)
- (Q6126255) (← links)
- On Homomorphism Graphs (Q6382336) (← links)
