Pages that link to "Item:Q3149868"

The following pages link to The Combinatorial Structure of Wait-Free Solvable Tasks (Q3149868):

Displaying 24 items.

• A non-topological proof for the impossibility of \(k\)-set agreement (Q391997) (← links)
• Power and limits of distributed computing shared memory models (Q392187) (← links)
• The renaming problem in shared memory systems: an introduction (Q465682) (← links)
• An equivariance theorem with applications to renaming (Q486986) (← links)
• New combinatorial topology bounds for renaming: the lower bound (Q992504) (← links)
• Collapsibility of read/write models using discrete Morse theory (Q1616395) (← links)
• Renaming and the weakest family of failure detectors (Q1938384) (← links)
• Gathering identical autonomous systems on a circle using stigmergy (Q1938388) (← links)
• A simplicial complex model for dynamic epistemic logic to study distributed task computability (Q2029604) (← links)
• A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring (Q2304020) (← links)
• Generalized symmetry breaking tasks and nondeterminism in concurrent objects (Q2802146) (← links)
• Stability of multi-valued continuous consensus (Q2810955) (← links)
• An axiomatic approach to computing the connectivity of synchronous and asynchronous systems (Q2810958) (← links)
• A simple constructive computability theorem for wait-free computation (Q2817615) (← links)
• An Equivariance Theorem with Applications to Renaming (Q2894460) (← links)
• Schlegel Diagram and Optimizable Immediate Snapshot Protocol (Q3300823) (← links)
• (Q3305190) (← links)
• (Q3384879) (← links)
• Bounds on the Step and Namespace Complexity of Renaming (Q4646446) (← links)
• Hundreds of impossibility results for distributed computing (Q5138488) (← links)
• An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing (Q5179018) (← links)
• An Introduction to the Topological Theory of Distributed Computing with Safe-consensus (Q5179019) (← links)
• The solvability of consensus in iterated models extended with safe-consensus (Q6056624) (← links)
• Why Extension-Based Proofs Fail (Q6115415) (← links)