Pages that link to "Item:Q4978023"

The following pages link to On the complexity of local distributed graph problems (Q4978023):

Displaying 35 items.

• Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
• Almost global problems in the LOCAL model (Q1981631) (← links)
• Linial for lists (Q2104037) (← links)
• Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
• What can be sampled locally? (Q2189170) (← links)
• Improved deterministic distributed matching via rounding (Q2189173) (← links)
• Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
• Randomized distributed decision (Q2256969) (← links)
• Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
• Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022 (Q2693035) (← links)
• Constant space and non-constant time in distributed computing (Q3300833) (← links)
• The Time-Complexity of Local Decision in Distributed Agreement (Q3507518) (← 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)
• Distributed Spanner Approximation (Q4997324) (← links)
• (Delta+1) Coloring in the Congested Clique Model (Q5002850) (← links)
• Distributed set cover approximation: Primal-dual with optimal locality (Q5090914) (← links)
• (Q5090928) (← links)
• Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
• Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
• Foundations of Software Science and Computation Structures (Q5308444) (← links)
• Simple and local independent set approximation (Q5919021) (← links)
• A topological perspective on distributed network algorithms (Q5919043) (← links)
• Beep-and-sleep: message and energy efficient set cover (Q5925658) (← links)
• Node and edge averaged complexities of local graph problems (Q6071120) (← links)
• Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics (Q6076330) (← links)
• On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
• Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← 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 distributed approximations for maximum independent set (Q6535034) (← links)
• Distributed domination on sparse graph classes (Q6614403) (← links)
• Distributed computing in the asynchronous LOCAL model (Q6652468) (← links)
• Near-optimal distributed dominating set in bounded arboricity graphs (Q6658821) (← links)