Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Stabilization-preserving atomicity refinement
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Token Based Group Mutual Exclusion for Asynchronous Rings (Extended Abstract)
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Self-stabilizing philosophers with generic conflicts
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
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
Distance-k information in self-stabilizing algorithms
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
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 algorithm for constructing weakly connected minimal dominating sets
Information Processing Letters
A self-stabilizing 23-approximation algorithm for the maximum matching problem
Theoretical Computer Science
Efficient transformation of distance-2 self-stabilizing algorithms
Journal of Parallel and Distributed Computing
A self-stabilizing algorithm to maximal 2-packing with improved complexity
Information Processing Letters
A self-stabilizing algorithm for optimally efficient sets in graphs
Information Processing Letters
Self-stabilizing consensus average algorithm in distributed sensor networks
Transactions on Large-Scale Data- and Knowledge-centered systems IX
Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
Journal of Parallel and Distributed Computing
Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs
Information Processing Letters
| Hi-index | 5.23 |
Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisions based on the states of their immediate neighbors. We provide a general transformation for constructing self-stabilizing algorithms which utilize distance-k knowledge. Our transformation has both a slowdown and space overhead in n^O^(^l^o^g^k^), and might be thought of as a distance-k resource allocation algorithm. Our main application is a polynomial-time self-stabilizing algorithm for finding maximal irredundant sets, a problem which seems to require distance-4 information. These results can be generalized to efficiently find maximal P-sets, for properties P which we call local monotonic. Our techniques extend results in a recent paper by Gairing et al. for achieving distance-two information.