Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Self-stabilizing unidirectional network algorithms by power-supply
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
IEEE Transactions on Computers
A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
A self-stabilizing k-clustering algorithm for weighted graphs
Journal of Parallel and Distributed Computing
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Slf-stabiliezing leader election in dynamic networks
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Fast and compact self stabilizing verification, computation, and fault detection of an MST
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
An O(n)-time self-stabilizing leader election algorithm
Journal of Parallel and Distributed Computing
Self-stabilizing leader election in optimal space under an arbitrary scheduler
Theoretical Computer Science
A new polynomial silent stabilizing spanning-tree construction algorithm
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
The first fully polynomial stabilizing algorithm for BFS tree construction
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Self-stabilizing k-hops clustering algorithm for wireless ad hoc networks
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
A silent self-stabilizing asynchronous distributed algorithm, SSLE, for the leader election problem, in a connected unoriented network with unique IDs, is given. SSLE uses O (logn ) space per process and stabilizes in O (n ) rounds, where n is the number of processes in the network.