A self-stabilizing algorithm for maximal matching
Information Processing Letters
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
SIAM Journal on Computing
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
A self-stabilizing algorithm for maximal 2-packing
Nordic Journal of Computing
Conflict Managers for Self-stabilization without Fairness Assumption
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Distance- k knowledge in self-stabilizing algorithms
Theoretical Computer Science
A memory efficient self-stabilizing algorithm for maximal k-packing
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
Journal of Parallel and Distributed Computing
| Hi-index | 0.89 |
In self-stabilization, each node has a local view of the distributed network system, in a finite amount of time the system converges to a global setup with desired property, in this case establishing a 2-packing set. Using a graph G=(V,E) to represent the network, a subset S@?V is a 2-packing if @?i@?V:|N[i]@?S|=