Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler
Authors:
- 17 August 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 458-465
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case studyDistributed Computing, 2000
- A self-stabilizing algorithm for coloring planar graphsDistributed Computing, 1993
- A self-stabilizing algorithm for coloring bipartite graphsInformation Sciences, 1993
- Self-stabilizationACM Computing Surveys, 1993
- Labelling Graphs with a Condition at Distance 2SIAM Journal on Discrete Mathematics, 1992
- A self-stabilizing algorithm for maximal matchingInformation Processing Letters, 1992
- An O(v|v| c |E|) algoithm for finding maximum matching in general graphs1980
- Self-stabilizing systems in spite of distributed controlCommunications of the ACM, 1974