Locality and Checkability in Wait-Free Computing
From MaRDI portal
Publication:3095336
DOI10.1007/978-3-642-24100-0_34zbMath1311.68025OpenAlexW2105440249MaRDI QIDQ3095336
Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
Publication date: 28 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24100-0_34
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)
Related Items (4)
Unnamed Item ⋮ Power and limits of distributed computing shared memory models ⋮ Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability ⋮ Locality and checkability in wait-free computing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed enumeration
- On the power of synchronization between two adjacent processes
- Communication algorithms with advice
- Self-testing/correcting with applications to numerical problems
- Efficient learning of typical finite automata from random walks
- Spot-checkers
- A classification of wait-free loop agreement tasks
- Designing checkers for programs that run in parallel
- Covering complexes with applications to algebra
- Proof labeling schemes
- Locality and checkability in wait-free computing
- Toward more localized local algorithms
- Locally checkable proofs
- Property testing and its connection to learning and approximation
- The topological structure of asynchronous computability
- Renaming in an asynchronous environment
- Deterministic coin tossing with applications to optimal parallel list ranking
- Reaching approximate agreement in the presence of faults
- Impossibility of distributed consensus with one faulty process
- Locality in Distributed Graph Algorithms
- Three-Processor Tasks Are Undecidable
- Designing programs that check their work
- Distributed Computing: A Locality-Sensitive Approach
- What Can be Computed Locally?
- Deterministic distributed vertex coloring in polylogarithmic time
- On the complexity of distributed graph coloring
- Distributed verification and hardness of distributed approximation
- Local Distributed Decision
This page was built for publication: Locality and Checkability in Wait-Free Computing
