Pages that link to "Item:Q3990110"

The following pages link to Locality in Distributed Graph Algorithms (Q3990110):

Displaying 50 items.

• What Can be Computed in a Distributed System? (Q5170751) (← links)
• LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS (Q5189993) (← links)
• The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← links)
• Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs (Q5302070) (← links)
• Simple Neural-Like P Systems for Maximal Independent Set Selection (Q5378208) (← links)
• Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes (Q5458525) (← links)
• (Q5743466) (← links)
• Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
• Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
• Deterministic compression with uncertain priors (Q5891037) (← links)
• How long it takes for an ordinary node with an ordinary ID to output? (Q5916003) (← links)
• Local approximation of the maximum cut in regular graphs (Q5918122) (← links)
• Weak models of distributed computing, with connections to modal logic (Q5918244) (← links)
• Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5918492) (← links)
• Superfast coloring in CONGEST via efficient color sampling (Q5918634) (← links)
• Distributed coloring and the local structure of unit-disk graphs (Q5918711) (← links)
• A topological perspective on distributed network algorithms (Q5919043) (← links)
• Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (Q5919420) (← links)
• Distributed MST for constant diameter graphs (Q5919895) (← links)
• Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
• Making local algorithms wait-free: the case of ring coloring (Q5920224) (← links)
• Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)
• Distributed coloring and the local structure of unit-disk graphs (Q5925586) (← links)
• Superfast coloring in CONGEST via efficient color sampling (Q5925614) (← links)
• Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5925671) (← links)
• A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)
• Local deal-agreement algorithms for load balancing in dynamic general graphs (Q6038713) (← links)
• Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) (← links)
• Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics (Q6076330) (← links)
• Distributed Testing of Graph Isomorphism in the CONGEST Model. (Q6084362) (← links)
• Locally checkable problems in rooted trees (Q6096035) (← links)
• Brief announcement: Distributed reconfiguration of spanning trees (Q6097213) (← links)
• On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
• Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
• Distributed computing with the Cloud (Q6126134) (← links)
• Component stability in low-space massively parallel computation (Q6126138) (← links)
• Bounds and algorithms for generalized superimposed codes (Q6161430) (← links)
• A note on the network coloring game: a randomized distributed \((\Delta+1)\)-coloring algorithm (Q6161445) (← links)
• Distributed half-integral matching and beyond (Q6199402) (← links)
• Theory of graph neural networks: representation and learning (Q6200219) (← links)
• Distributed Computing with the Cloud (Q6488431) (← links)
• Local conflict coloring revisited: Linial for lists (Q6535013) (← links)
• Classification of distributed binary labeling problems (Q6535014) (← links)
• The complexity landscape of distributed locally checkable problems on trees (Q6535015) (← links)
• Improved MPC algorithms for MIS, matching, and coloring on trees and beyond (Q6535033) (← links)
• Improved distributed approximations for maximum independent set (Q6535034) (← links)
• Distributed maximum matching verification in CONGEST (Q6535036) (← links)
• Coloring fast without learning your neighbors' colors (Q6535038) (← links)
• Brief announcement: Efficient load-balancing through distributed token dropping (Q6535039) (← links)
• Resource efficient stabilization for local tasks despite unknown capacity links (Q6612539) (← links)