SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM (Q3146520): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Self-stabilizing depth-first search / 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: Self-stabilization of dynamic systems assuming only read/write atomicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilization (in spite of distributed control) in tree-structured systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new solution of Dijkstra's concurrent programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mutual exclusion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813266 / rank
 
Normal rank

Latest revision as of 16:57, 4 June 2024

scientific article
Language Label Description Also known as
English
SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM
scientific article

    Statements

    SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM (English)
    0 references
    0 references
    0 references
    12 September 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    self-stabilizing distributed algorithms
    0 references
    0 references