The following pages link to Super-Fast 3-Ruling Sets. (Q2957487):
Displaying 10 items.
- Lessons from the congested clique applied to MapReduce (Q896148) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Deterministic distributed ruling sets of line graphs (Q1713911) (← links)
- Blazing fast OT for three-round UC OT extension (Q2055696) (← links)
- Distributed reconfiguration of maximal independent sets (Q2186816) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- Distributed Reconfiguration of Maximal Independent Sets (Q5092338) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
- Symmetry breaking in the Congest model: time- and message-efficient algorithms for ruling sets (Q6487514) (← links)