The following pages link to What Can be Computed Locally? (Q4862796):
Displaying 42 items.
- Ramanujan graphings and correlation decay in local algorithms (Q3452726) (← links)
- Exact Bounds for Distributed Graph Colouring (Q3460706) (← links)
- Local Maps: New Insights into Mobile Agent Algorithms (Q3540225) (← links)
- Leveraging Linial’s Locality Limit (Q3540245) (← links)
- A Limit to the Power of Multiple Nucleation in Self-assembly (Q3540250) (← 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)
- On the probe complexity of local computation algorithms (Q5002725) (← links)
- (Delta+1) Coloring in the Congested Clique Model (Q5002850) (← links)
- Introduction to local certification (Q5024672) (← links)
- Locally computable enumerations (Q5055920) (← links)
- Almost global problems in the LOCAL model (Q5090898) (← links)
- (Q5090918) (← links)
- Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921) (← links)
- Equilibria of Games in Networks for Local Tasks (Q5091077) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- What can be decided locally without identifiers? (Q5176091) (← links)
- The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← links)
- What Can be Sampled Locally? (Q5368952) (← links)
- Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes (Q5458525) (← links)
- Experimental and Efficient Algorithms (Q5710027) (← links)
- (Q5743464) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
- How long it takes for an ordinary node with an ordinary ID to output? (Q5916003) (← links)
- Weak models of distributed computing, with connections to modal logic (Q5918244) (← links)
- Making local algorithms wait-free: the case of ring coloring (Q5920224) (← links)
- Representing graphs implicitly using almost optimal space (Q5928875) (← links)
- (Q6065460) (← links)
- Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics (Q6076330) (← links)
- Locally checkable problems in rooted trees (Q6096035) (← links)
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
- Component stability in low-space massively parallel computation (Q6126138) (← links)
- Lower bound for constant-size local certification (Q6155248) (← links)
- Distributed half-integral matching and beyond (Q6199402) (← links)
- Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs (Q6488452) (← links)
- Classification of distributed binary labeling problems (Q6535014) (← links)
- The complexity landscape of distributed locally checkable problems on trees (Q6535015) (← links)
- Brief announcement: Efficient load-balancing through distributed token dropping (Q6535039) (← links)
- Brief announcement: Distributed graph problems through an automata-theoretic lens (Q6535040) (← links)
- The topology of local computing in networks (Q6645920) (← links)
- Distributed computing in the asynchronous LOCAL model (Q6652468) (← links)
