Pages that link to "Item:Q5348856"
From MaRDI portal
The following pages link to Fast randomized algorithms for distributed edge coloring (Q5348856):
Displayed 6 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)