Pages that link to "Item:Q4943878"

The following pages link to Wait-Free <i>k</i>-Set Agreement is Impossible: The Topology of Public Knowledge (Q4943878):

Displaying 50 items.

• Distributed universality (Q329296) (← links)
• The topology of distributed adversaries (Q360277) (← links)
• 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)
• Linear space bootstrap communication schemes (Q477099) (← links)
• The computability of relaxed data structures: queues and stacks as examples (Q518927) (← links)
• On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems (Q555307) (← links)
• The disagreement power of an adversary (Q661056) (← links)
• On set consensus numbers (Q661057) (← links)
• The minimum information about failures for solving non-local tasks in message-passing systems (Q661069) (← links)
• Tight bounds on the round complexity of distributed 1-solvable tasks (Q673104) (← links)
• Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures (Q987393) (← links)
• New combinatorial topology bounds for renaming: the lower bound (Q992504) (← links)
• Anti-\(\Omega \): the weakest failure detector for set agreement (Q992506) (← links)
• A topological treatment of early-deciding set-agreement (Q1004319) (← links)
• From adaptive renaming to set agreement (Q1008730) (← links)
• Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound (Q1041222) (← links)
• Collapsibility of read/write models using discrete Morse theory (Q1616395) (← links)
• On the uncontended complexity of anonymous agreement (Q1682223) (← links)
• Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems (Q1686116) (← links)
• Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers (Q1741965) (← links)
• Partial synchrony based on set timeliness (Q1938365) (← links)
• Tight bounds for \(k\)-set agreement with limited-scope failure detectors (Q1953644) (← links)
• A simplicial complex model for dynamic epistemic logic to study distributed task computability (Q2029604) (← links)
• Contention-related crash failures: definitions, agreement algorithms, and impossibility results (Q2078617) (← links)
• Bounded disagreement (Q2182645) (← links)
• Waiting in concurrent algorithms (Q2218425) (← links)
• The \(k\)-simultaneous consensus problem (Q2377137) (← links)
• On the computability power and the robustness of set agreement-oriented failure detector classes (Q2377255) (← links)
• From wait-free to arbitrary concurrent solo executions in colorless distributed computing (Q2397607) (← links)
• Of choices, failures and asynchrony: the many faces of set agreement (Q2428676) (← links)
• Algebraic topology and concurrency (Q2500494) (← links)
• Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement (Q2672233) (← links)
• Agreeing within a few writes (Q2672593) (← links)
• Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects (Q2802146) (← links)
• An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems (Q2810958) (← links)
• Asynchronous Coordination Under Preferences and Constraints (Q2835020) (← links)
• t-Resilient Immediate Snapshot Is Impossible (Q2835025) (← links)
• Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems (Q2868653) (← links)
• Generalized Universality (Q3090818) (← links)
• Oblivious Collaboration (Q3095350) (← links)
• (Q3305190) (← links)
• A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling (Q3460730) (← links)
• The Computability of Relaxed Data Structures: Queues and Stacks as Examples (Q3460732) (← links)
• The Iterated Restricted Immediate Snapshot Model (Q3511360) (← links)
• The Weakest Failure Detector for Message Passing Set-Agreement (Q3540224) (← links)
• Back to the Coordinated Attack Problem (Q5006457) (← links)
• Hundreds of impossibility results for distributed computing (Q5138488) (← links)
• (Q5155689) (← links)