Pages that link to "Item:Q5144922"
From MaRDI portal
The following pages link to Polylogarithmic-time deterministic network decomposition and distributed derandomization (Q5144922):
Displaying 29 items.
- Distributed independent sets in interval and segment intersection graphs (Q831804) (← links)
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- Loosely-stabilizing maximal independent set algorithms with unreliable communications (Q2089676) (← links)
- Linial for lists (Q2104037) (← links)
- Efficient and competitive broadcast in multi-channel radio networks (Q2105449) (← links)
- Distributed graph problems through an automata-theoretic Lens (Q2117706) (← links)
- Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring (Q2664558) (← links)
- Distributed strong diameter network decomposition (Q2672581) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- Distributed graph problems through an automata-theoretic lens (Q2689441) (← links)
- Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022 (Q2693035) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Distributed Testing of Distance-k Colorings (Q5100965) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC (Q5860478) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
- Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5918492) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5918634) (← links)
- Distributed coloring and the local structure of unit-disk graphs (Q5918711) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5925614) (← links)
- Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5925671) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
- Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics (Q6076330) (← links)
- Locally checkable problems in rooted trees (Q6096035) (← 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)
