Pages that link to "Item:Q4575915"
From MaRDI portal
The following pages link to Distributed Degree Splitting, Edge Coloring, and Orientations (Q4575915):
Displaying 16 items.
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- Almost global problems in the LOCAL model (Q1981631) (← links)
- Linial for lists (Q2104037) (← links)
- Distributed graph problems through an automata-theoretic Lens (Q2117706) (← links)
- What can be sampled locally? (Q2189170) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Improved distributed degree splitting and edge coloring (Q2189174) (← links)
- Distributed graph problems through an automata-theoretic lens (Q2689441) (← 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)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs (Q5115699) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
- Component stability in low-space massively parallel computation (Q6126138) (← links)
