The following pages link to Brief Announcement (Q5361934):
Displayed 15 items.
- Computing large independent sets in a single round (Q1699422) (← links)
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- Local mending (Q2097329) (← links)
- What can be sampled locally? (Q2189170) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Optimal distributed covering algorithms (Q2689837) (← links)
- A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
- Almost global problems in the LOCAL model (Q5090898) (← links)
- Distributed Recoloring (Q5090902) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- How long it takes for an ordinary node with an ordinary ID to output? (Q5916003) (← links)
- Local approximation of the maximum cut in regular graphs (Q5918122) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)