The following pages link to (Q4608064):
Displaying 10 items.
- Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
- Local mending (Q2097329) (← links)
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring (Q2664558) (← links)
- Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022 (Q2693035) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
- Almost global problems in the LOCAL model (Q5090898) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
- Classification of distributed binary labeling problems (Q6535014) (← links)
- Borel Vizing's theorem for graphs of subexponential growth (Q6654016) (← links)
