A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity (Q1779602): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Self-stabilizing systems in spite of distributed control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3962450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A belated proof of self-stabilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Stabilizing Algorithms for Finding Centers and Medians of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilization of dynamic systems assuming only read/write atomicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing algorithm which finds a 2-center of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2782251 / rank
 
Normal rank

Latest revision as of 12:04, 10 June 2024

scientific article
Language Label Description Also known as
English
A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity
scientific article

    Statements

    A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2005
    0 references
    Self-stabilizing algorithm
    0 references
    Model of computation
    0 references
    Read/write separate atomicity
    0 references
    Interleaving model
    0 references
    Center
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references