The following pages link to Yannic Maus (Q1660924):
Displaying 25 items.
- Polynomial lower bound for distributed graph coloring in a weak LOCAL model (Q1660925) (← links)
- Deterministic distributed ruling sets of line graphs (Q1713911) (← links)
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- Greedy routing and the algorithmic small-world phenomenon (Q2071825) (← links)
- Linial for lists (Q2104037) (← links)
- Near-optimal scheduling in the congested clique (Q2117708) (← links)
- Improved distributed degree splitting and edge coloring (Q2189174) (← links)
- Rumor spreading with bounded in-degree (Q2292916) (← links)
- On the complexity of local distributed graph problems (Q4978023) (← links)
- (Q5092353) (← links)
- Deterministic Distributed Dominating Set Approximation in the CONGEST Model (Q5145186) (← links)
- On the Complexity of Distributed Splitting Problems (Q5145221) (← links)
- P-SLOCAL-Completeness of Maximum Independent Set Approximation (Q5145225) (← links)
- A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma (Q5145239) (← links)
- Improved Distributed Delta-Coloring (Q5197708) (← links)
- Deterministic distributed edge-coloring with fewer colors (Q5230307) (← links)
- Greedy Routing and the Algorithmic Small-World Phenomenon (Q5368989) (← links)
- Distributed Approximation on Power Graphs (Q5854058) (← links)
- Distance-2 Coloring in the CONGEST Model (Q5855241) (← links)
- Efficient Deterministic Distributed Coloring with Small Bandwidth (Q5855242) (← links)
- Brief Announcement: Classification of Distributed Binary Labeling Problems (Q5855255) (← links)
- Locally checkable labelings with small messages (Q6083368) (← links)
- Efficient CONGEST Algorithms for the Lovasz Local Lemma (Q6083398) (← links)
- (Q6126264) (← links)
- Improved distributed degree splitting and edge coloring (Q6487490) (← links)
