Pages that link to "Item:Q5236233"

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to Distributed Maximal Independent Set using Small Messages (Q5236233):

Displaying 22 items.

An optimal bit complexity randomized distributed MIS algorithm (Q658666) (← links)
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
Distributed reconfiguration of maximal independent sets (Q2186816) (← links)
Super-Fast 3-Ruling Sets. (Q2957487) (← links)
Using Read-k Inequalities to Analyze a Distributed MIS Algorithm (Q3174932) (← links)
(Q5092346) (← links)
Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
Maximal independent sets in multichannel radio networks (Q5176112) (← links)
Optimal Dynamic Distributed MIS (Q5361939) (← links)
Distributed MIS via All-to-All Communication (Q5368954) (← links)
Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5918492) (← links)
Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5925671) (← links)
Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics (Q6076330) (← links)
Time-optimal construction of overlay networks (Q6096036) (← links)
Derandomizing local distributed algorithms under bandwidth restrictions (Q6487482) (← links)
Symmetry breaking in the Congest model: time- and message-efficient algorithms for ruling sets (Q6487514) (← links)
Improved network decompositions using small messages with applications on MIS, neighborhood covers, and beyond (Q6487534) (← links)
The complexity of symmetry breaking in massive graphs (Q6487543) (← links)
Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications (Q6488445) (← links)
Improved distributed approximations for maximum independent set (Q6535034) (← links)
Coloring fast without learning your neighbors' colors (Q6535038) (← links)