The Bit Complexity of Randomized Leader Election on a Ring (Q3829068)

From MaRDI portal
Revision as of 22:47, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Bit Complexity of Randomized Leader Election on a Ring
scientific article

    Statements

    The Bit Complexity of Randomized Leader Election on a Ring (English)
    0 references
    1989
    0 references
    complexity
    0 references
    leader election
    0 references
    asynchronous distributed computation
    0 references
    randomized algorithms
    0 references
    processor rings
    0 references
    communication complexity
    0 references
    attrition
    0 references
    solitude verification
    0 references
    lower bounds
    0 references

    Identifiers