Self-stabilizing leader election in polynomial steps (Q528197): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: An \(O(n)\)-time self-stabilizing leader election algorithm / 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: Memory requirements for silent stabilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time optimal self-stabilizing synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time Optimal Asynchronous Self-stabilizing Spanning Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed reset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4457232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed network protocols / rank
 
Normal rank

Revision as of 18:55, 13 July 2024

scientific article
Language Label Description Also known as
English
Self-stabilizing leader election in polynomial steps
scientific article

    Statements

    Self-stabilizing leader election in polynomial steps (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 May 2017
    0 references
    distributed algorithms
    0 references
    fault-tolerance
    0 references
    self-stabilization
    0 references
    leader election
    0 references
    unfair daemon
    0 references

    Identifiers