Pages that link to "Item:Q3990110"

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

Displaying 50 items.

• Hypergraph-based irregular application locality optimization (Q2859911) (← links)
• Constructing near spanning trees with few local inspections (Q2977565) (← links)
• On the complexity of distributed graph coloring with local minimality constraints (Q3057099) (← links)
• Trading Bit, Message, and Time Complexity of Distributed Algorithms (Q3095315) (← links)
• Combinatorial Algorithms for Distributed Graph Coloring (Q3095316) (← links)
• Locality and Checkability in Wait-Free Computing (Q3095336) (← links)
• Broadcasting in an Unreliable SINR Model. (Q3300801) (← links)
• Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← links)
• Constant space and non-constant time in distributed computing (Q3300833) (← links)
• An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) (Q3408183) (← links)
• Exact Bounds for Distributed Graph Colouring (Q3460706) (← links)
• A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
• Randomized OBDD-Based Graph Algorithms (Q3460720) (← links)
• Fast Distributed Approximations in Planar Graphs (Q3540222) (← links)
• Local Maps: New Insights into Mobile Agent Algorithms (Q3540225) (← links)
• Leveraging Linial’s Locality Limit (Q3540245) (← links)
• Minimum Entropy Combinatorial Optimization Problems (Q3576040) (← links)
• Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs (Q3602842) (← links)
• Checking Global Graph Properties by Means of Local Computations: the Majority Problem (Q4222809) (← links)
• Local-Global Phenomena in Graphs (Q4290099) (← links)
• An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
• (Q4633026) (← links)
• A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
• Weighted Message Passing and Minimum Energy Flow for Heterogeneous Stochastic Block Models with Side Information (Q4969043) (← links)
• Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
• Distributed Spanner Approximation (Q4997324) (← links)
• On the probe complexity of local computation algorithms (Q5002725) (← links)
• A two-sided error distributed property tester for conductance (Q5005119) (← links)
• Improved Dynamic Graph Coloring (Q5009642) (← links)
• Introduction to local certification (Q5024672) (← links)
• Neighborhood graphs and distributed Δ+1-coloring (Q5054815) (← links)
• Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
• (Q5075750) (← links)
• (Q5090456) (← links)
• (Q5090500) (← links)
• The role of a-priori information in networks of rational agents (Q5090894) (← links)
• Almost global problems in the LOCAL model (Q5090898) (← links)
• (Q5090928) (← links)
• Equilibria of Games in Networks for Local Tasks (Q5091077) (← links)
• When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
• Distributed Reconfiguration of Maximal Independent Sets (Q5092338) (← links)
• (Q5092346) (← links)
• Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
• Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
• Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
• Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs (Q5115699) (← links)
• Find Your Place: Simple Distributed Algorithms for Community Detection (Q5115703) (← links)
• Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
• Some simple distributed algorithms for sparse networks (Q5138354) (← links)
• An efficient distributed algorithm for constructing small dominating sets (Q5138380) (← links)