A reduction theorem for randomized distributed algorithms under weak adversaries (Q2234073): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The correctness proof of Ben-Or's randomized consensus algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized protocols for asynchronous consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of verifying message passing programs under bounded asynchrony / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous byzantine agreement protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reduction Theorem for the Verification of Round-Based Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication-closed asynchronous protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of distributed programs into communication-closed layers / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bosco: One-Step Byzantine Asynchronous Consensus / rank
 
Normal rank

Latest revision as of 19:53, 26 July 2024

scientific article
Language Label Description Also known as
English
A reduction theorem for randomized distributed algorithms under weak adversaries
scientific article

    Statements

    A reduction theorem for randomized distributed algorithms under weak adversaries (English)
    0 references
    0 references
    0 references
    0 references
    18 October 2021
    0 references
    communication closure
    0 references
    reduction
    0 references
    distributed algorithms
    0 references
    randomized consensus
    0 references
    weak adversaries
    0 references
    parameterized verification
    0 references

    Identifiers