Self-stabilizing unidirectional network algorithms by power supply, Chicago J. Theor. Comput. Sci, 1998. ,
A self-stabilizing distributed algorithm to find the center of a tree graph, Parallel Algorithms and Applications, vol.10, issue.34, pp.237-248, 1997. ,
Convergence of iteration systems, Distributed Computing, vol.7, issue.1, pp.43-53, 1993. ,
Cross-over composition-enforcement of fairness under unfair adversary, WSS'01, pp.19-34, 2001. ,
A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon, IPDPS'15, pp.1-10, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01201859
Fast selfstabilizing minimum spanning tree construction, DISC'10, pp.480-494, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00492398
On proof-labeling schemes versus silent self-stabilizing algorithms, SSS'14, pp.18-32, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01102123
A superstabilizing log (n)-approximation algorithm for dynamic steiner trees, SSS'09, pp.133-148, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00363003
Self-stabilizing minimum degree spanning tree within one from the optimal degree, J. of Parallel and Distributed Computing, vol.71, issue.3, pp.438-449, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00336713
Compact deterministic self-stabilizing leader election-the exponential advantage of being talkative, DISC'13, pp.76-90, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00930095
Self-stabilizing algorithms for finding centers and medians of trees, SIAM Journal of Computing, vol.29, issue.2, pp.600-614, 1999. ,
Time optimal asynchronous self-stabilizing spanning tree, DISC'07, pp.92-107, 2007. ,
A uniform self-stabilizing minimum diameter tree algorithm (extended abstract), WDAG'95, pp.257-272, 1995. ,
Self-stabilizing depth-first search, Information Processing Letters, vol.49, issue.6, pp.297-301, 1994. ,
A new polynomial silent stabilizing spanning-tree construction algorithm, SIROCCO'09, pp.141-153, 2009. ,
The first fully polynomial stabilizing algorithm for BFS tree construction, OPODIS'11, pp.159-174, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-01009450
Leader election and centers and medians in tree networks, SSS'13, pp.113-132, 2013. ,
An o(n)-time self-stabilizing leader election algorithm, J. Parallel Distrib. Comput, vol.71, issue.11, pp.1532-1544, 2011. ,
Self-stabilizing systems in spite of distributed control, Communication of the ACM, vol.17, issue.11, pp.643-644, 1974. ,
Self-stabilization, 2000. ,
URL : https://hal.archives-ouvertes.fr/inria-00627780
Self-stabilization of dynamic systems assuming only read/write atomicity, (PODC'90, pp.103-117, 1990. ,
Self-stabilization of dynamic systems assuming only read/write atomicity, Distributed Computing, vol.7, issue.1, pp.3-16, 1993. ,
Resource bounds for self-stabilizing message-driven protocols, SIAM J. Comput, vol.26, issue.1, pp.273-290, 1997. ,
Uniform dynamic self-stabilizing leader election, IEEE Trans. Parallel Distrib. Syst, vol.8, issue.4, pp.424-440, 1997. ,
Parallel composition of stabilizing algorithms, WSS'99, pp.25-32, 1999. ,
A taxonomy of daemons in self-stabilization, ArXiv eprint, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00628390
A survey of self-stabilizing spanning-tree construction algorithms, 2003. ,
Adaptive programming, IEEE Trans. Software Eng, vol.17, issue.9, pp.911-921, 1991. ,
Stabilizing communication protocols, IEEE Trans. Computers, vol.40, issue.4, pp.448-458, 1991. ,
Self-stabilizing protocol for shortest path tree for multi-cast routing in mobile networks ,
, Euro-Par'00, pp.600-604, 2000.
On the minimum diameter spanning tree problem, Information Processing Letters, vol.53, issue.2, pp.109-111, 1995. ,
Minimum diameter spanning trees and related problems, SIAM Journal of Computing, vol.20, issue.5, pp.987-997, 1991. ,
Optimal distributed all pairs shortest paths and applications, PODC'12, pp.355-364, 2012. ,
A self-stabilizing algorithm for constructing breadth-first trees, Information Processing Letters, vol.41, issue.2, pp.109-117, 1992. ,
Self-stabilizing depth-first token circulation on networks, Distributed Computing, vol.7, issue.1, pp.61-66, 1993. ,
A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity, J. Comput. Syst. Sci, vol.71, issue.1, pp.70-85, 2005. ,
Distributed algorithms for finding centers and medians in networks, ACM Transactions on Programming Languages and Systems, vol.6, issue.3, pp.380-401, 1984. ,
Fast and compact self stabilizing verification, computation, and fault detection of an MST, PODC'11, pp.311-320, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-01240211
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves, PPAM'05, pp.75-82, 2005. ,
Distributed algorithms for network diameter and girth, ICALP'12, pp.660-672, 2012. ,
Time and space optimality of distributed depth-first token circulation algorithms, WDAS'99, pp.91-106, 1999. ,
Fast approximation algorithms for the diameter and radius of sparse graphs, STOC'13, pp.515-524, 2013. ,
Algorithms and Theory of Computation Handbook, chapter Selfstabilizing Algorithms, vol.45, pp.26-27, 2009. ,
Compositional proofs of self-stabilizing protocols, WSS'97, pp.80-94, 1997. ,