Pages that link to "Item:Q5348856"
From MaRDI portal
The following pages link to Fast randomized algorithms for distributed edge coloring (Q5348856):
Displaying 15 items.
- Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
- Link scheduling in wireless sensor networks: distributed edge-coloring revisited (Q436862) (← links)
- Complete convergence of weighted sums under negative dependence (Q451510) (← links)
- A lower bound for communication on the crossbar (Q672740) (← links)
- Exploiting storage redundancy to speed up randomized shared memory simulations (Q1365933) (← links)
- Probabilistic recurrence relations revisited (Q1391296) (← links)
- Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory (Q2215966) (← links)
- Distributed strong diameter network decomposition (Q2672581) (← links)
- Neighborhood graphs and distributed Δ+1-coloring (Q5054815) (← links)
- (Q5075750) (← links)
- Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- (Probabilistic) recurrence relations revisited (Q5096333) (← links)
- Partitioning into degenerate graphs in linear time (Q6080366) (← links)
- Local conflict coloring revisited: Linial for lists (Q6535013) (← links)
