Pages that link to "Item:Q2441787"

The following pages link to Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787):

Displaying 8 items.

• Improved deterministic distributed matching via rounding (Q2189173) (← links)
• Fast rendezvous on a cycle by agents with different speeds (Q2357150) (← links)
• The ANTS problem (Q2401118) (← links)
• Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs (Q2441507) (← links)
• An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
• A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
• How long it takes for an ordinary node with an ordinary ID to output? (Q5916003) (← links)
• Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics (Q6076330) (← links)