A reduction theorem for randomized distributed algorithms under weak adversaries (Q2234073)

From MaRDI portal
Revision as of 19:53, 26 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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