On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems (Q555307): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Generalized FLP impossibility result for <i>t</i>-resilient asynchronous computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unreliable failure detectors for reliable distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weakest failure detector for solving consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for <i>k</i> -set agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakening Failure Detectors for k-Set Agreement Via the Partition Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing is harder than agreeing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight failure detection bounds on atomic object implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weakest failure detectors to solve certain fundamental problems in distributed computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Weakest Failure Detector for Message Passing Set-Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Disagreement Power of an Adversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weakest failure detector for solving k-set agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Failure detectors as type boosters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for \(k\)-set agreement with limited-scope failure detectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topological structure of asynchronous computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computability power and the robustness of set agreement-oriented failure detector classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-set agreement with limited accuracy failure detectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Failure detectors and the wait-free hierarchy (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wait-Free <i>k</i>-Set Agreement is Impossible: The Topology of Public Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-Ω / rank
 
Normal rank

Latest revision as of 08:33, 4 July 2024

scientific article
Language Label Description Also known as
English
On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems
scientific article

    Statements

    On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems (English)
    0 references
    0 references
    0 references
    22 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    asynchronous systems
    0 references
    eventual leaders
    0 references
    failure detectors
    0 references
    message-passing systems
    0 references
    quorums
    0 references
    reduction
    0 references
    \(k\)-set agreement
    0 references
    wait-freedom
    0 references
    0 references
    0 references