A self-stabilizing algorithm for maximal matching
Information Processing Letters
Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
ACM Computing Surveys (CSUR)
A self-stabilizing algorithm for coloring bipartite graphs
Information Sciences: an International Journal
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Composition and Behaviors of Probabilistic I/O Automata
CONCUR '94 Proceedings of the Concurrency Theory
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
Distributed Computing
A self-stabilizing algorithm for coloring planar graphs
Distributed Computing - Special issue: Self-stabilization
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
A Self-stabilizing $\frac{2}{3}$-Approximation Algorithm for the Maximum Matching Problem
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A self-stabilizing 23-approximation algorithm for the maximum matching problem
Theoretical Computer Science
Self-stabilizing population protocols
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
An efficient self-stabilizing distance-2 coloring algorithm
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
An efficient self-stabilizing distance-2 coloring algorithm
Theoretical Computer Science
| Hi-index | 0.01 |
We propose a self-stabilizing probabilistic solution for the neighborhood unique naming problem in uniform, anonymous networks with arbitrary topology. This problem is important in the graph theory Our solution stabilizes under the unfair distributed scheduler. We prove that this solution needs in average only one trial per processor. We use our algorithm to transform the [6] maximal matching algorithm selfstabilizing to be able to cope up with a distributed scheduler.