An \(O(n)\)-time self-stabilizing leader election algorithm (Q645826): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4259994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed reset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time optimal self-stabilizing synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing leader election in optimal space under an arbitrary scheduler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing systems in spite of distributed control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2782251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259989 / rank
 
Normal rank

Revision as of 14:58, 4 July 2024

scientific article
Language Label Description Also known as
English
An \(O(n)\)-time self-stabilizing leader election algorithm
scientific article

    Statements

    An \(O(n)\)-time self-stabilizing leader election algorithm (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2011
    0 references
    distributed algorithm
    0 references
    leader election
    0 references
    self-stabilization
    0 references
    silent algorithm
    0 references
    unfair daemon
    0 references

    Identifiers