Three-Processor Tasks Are Undecidable
From MaRDI portal
Recommendations
Cited in
(23)- An algorithmic approach to the asynchronous computability theorem
- A classification of wait-free loop agreement tasks
- The topology of look-compute-move robot wait-free algorithms with hard termination
- A simplicial complex model for dynamic epistemic logic to study distributed task computability
- A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing
- Locality and checkability in wait-free computing
- Locality and checkability in wait-free computing
- scientific article; zbMATH DE number 7228882 (Why is no real title available?)
- A simplicial complex model for dynamic epistemic logic to study distributed task computability
- The topology of distributed adversaries
- A non-topological proof for the impossibility of \(k\)-set agreement
- Power and limits of distributed computing shared memory models
- Communication Complexity of Wait-Free Computability in Dynamic Networks
- Hundreds of impossibility results for distributed computing
- Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
- An inductive-style procedure for counting monochromatic simplexes of symmetric subdivisions with applications to distributed computing
- Untangling partial agreement: iterated \(x\)-consensus simulations
- Wait-free solvability of colorless tasks in anonymous shared-memory model
- Brief announcement: On decidability of 2-process affine models
- The computational power of distributed shared-memory models with bounded-size registers
- New combinatorial topology bounds for renaming: the lower bound
- Anti-\(\Omega \): the weakest failure detector for set agreement
This page was built for publication: Three-Processor Tasks Are Undecidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229418)
