Distributed computing in the asynchronous LOCAL model
From MaRDI portal
Publication:6652468
DOI10.1016/j.tcs.2024.114952MaRDI QIDQ6652468
Mikaël Rabie, Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud
Publication date: 12 December 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Cites Work
- Polynomial lower bound for distributed graph coloring in a weak LOCAL model
- Best of two local models: centralized local and distributed local algorithms
- Survey of local algorithms
- On the power of the congested clique model
- Exact Bounds for Distributed Graph Colouring
- Deterministic coin tossing with applications to optimal parallel list ranking
- Complexity of network synchronization
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Locality in Distributed Graph Algorithms
- Distributed Computing: A Locality-Sensitive Approach
- Distributed (Δ +1)-Coloring in Sublogarithmic Rounds
- An Optimal Synchronizer for the Hypercube
- What Can be Computed Locally?
- On the complexity of local distributed graph problems
- Locally-Iterative Distributed (Δ+ 1)
- An optimal distributed (Δ+1)-coloring algorithm?
- Weak models of distributed computing, with connections to modal logic
- Distributed algorithms for the Lovász local lemma and graph coloring
- Making local algorithms wait-free: the case of ring coloring
- Improved deterministic distributed matching via rounding
This page was built for publication: Distributed computing in the asynchronous LOCAL model
