Pages that link to "Item:Q2934351"

The following pages link to On the locality of distributed sparse spanner construction (Q2934351):

Displaying 21 items.

• A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
• Sublinear fully distributed partition with applications (Q1959378) (← links)
• Graph spanners: a tutorial review (Q2026289) (← links)
• Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
• The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
• Distributed construction of low-interference spanners (Q2377128) (← links)
• Distributed distance computation and routing with small messages (Q2422769) (← links)
• Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
• Rumor Spreading with No Dependence on Conductance (Q2963582) (← links)
• Simple Distributed Spanners in Dense Congest Networks (Q3297775) (← links)
• A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
• Sparser: A Paradigm for Running Distributed Algorithms (Q4033771) (← links)
• Distributed Spanner Approximation (Q4997324) (← links)
• (Q5002766) (← links)
• (Q5090437) (← links)
• Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921) (← links)
• Congested Clique Algorithms for Graph Spanners (Q5090933) (← links)
• The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
• Distributed Spanner Approximation (Q5197675) (← links)
• Distributed construction of purely additive spanners (Q5915631) (← links)
• Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900) (← links)