Pages that link to "Item:Q1260652"

The following pages link to More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems (Q1260652):

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)
• On Byzantine generals with alternative plans (Q436889) (← links)
• The renaming problem in shared memory systems: an introduction (Q465682) (← links)
• Linear space bootstrap communication schemes (Q477099) (← 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)
• A necessary condition for Byzantine \(k\)-set agreement (Q738885) (← links)
• An impossibility about failure detectors in the iterated immediate snapshot model (Q975436) (← links)
• Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures (Q987393) (← links)
• A note on atomicity: boosting Test\&Set to solve consensus (Q987831) (← 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)
• Classifying rendezvous tasks of arbitrary dimension (Q1019731) (← links)
• Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound (Q1041222) (← links)
• Stability of long-lived consensus. (Q1401978) (← 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)
• Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks (Q1743719) (← links)
• A classification of wait-free loop agreement tasks (Q1870526) (← links)
• A necessary and sufficient condition for transforming limited accuracy failure detectors (Q1878682) (← links)
• Partial synchrony based on set timeliness (Q1938365) (← links)
• The topology of look-compute-move robot wait-free algorithms with hard termination (Q2002056) (← links)
• Contention-related crash failures: definitions, agreement algorithms, and impossibility results (Q2078617) (← links)
• Life beyond set agreement (Q2189171) (← links)
• Synchronous condition-based consensus (Q2375299) (← links)
• The \(k\)-simultaneous consensus problem (Q2377137) (← links)
• On the computability power and the robustness of set agreement-oriented failure detector classes (Q2377255) (← links)
• On the weakest failure detector ever (Q2377264) (← 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)
• Locality and checkability in wait-free computing (Q2441537) (← links)
• Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement (Q2672233) (← links)
• Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects (Q2802146) (← links)
• The Complexity of Early Deciding Set Agreement: How can Topology help? (Q2810957) (← links)
• Recent Results on Fault-Tolerant Consensus in Message-Passing Networks (Q2835019) (← 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)
• Structured Derivation of Semi-Synchronous Algorithms (Q3095340) (← links)
• (Q3305190) (← links)
• The Iterated Restricted Immediate Snapshot Model (Q3511360) (← links)