Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures (Q987393): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplifying fault-tolerance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial characterization of the distributed 1-solvable tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on the round complexity of distributed 1-solvable tasks / rank
 
Normal rank
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: Uniform consensus is harder than 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: Early stopping in Byzantine agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the time to assure interactive consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of distributed consensus with one faulty process / rank
 
Normal rank
Property / cites work
 
Property / cites work: From a static impossibility to an adaptive lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Topological Treatment of Early-Deciding Set-Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Early Deciding Set Agreement: How can Topology help? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topological structure of asynchronous computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the uniform consensus synchronous lower bound. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / 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: Automatically increasing the fault-tolerance of distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed agreement in the presence of processor and communication faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures / 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: Structured derivations of consensus algorithms for failure detectors / rank
 
Normal rank

Latest revision as of 02:41, 3 July 2024

scientific article
Language Label Description Also known as
English
Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures
scientific article

    Statements

    Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures (English)
    0 references
    0 references
    0 references
    13 August 2010
    0 references
    0 references
    agreement problem
    0 references
    crash failure
    0 references
    strong termination
    0 references
    early decision
    0 references
    early stopping
    0 references
    efficiency
    0 references
    \(k\)-set agreement
    0 references
    message-passing system
    0 references
    receive omission failure
    0 references
    round-based computation
    0 references
    send omission failure
    0 references
    synchronous system
    0 references
    0 references
    0 references