Y. Afek, S. Kutten, and M. Yung, Memory-efficient self stabilizing protocols for general networks, 4th International Workshop on Distributed Algorithm (WDAG), volume LNCS 486, pp.15-28, 1991.
DOI : 10.1007/3-540-54099-7_2

A. Arora and M. G. Gouda, Distributed reset (extended abstract), 10th Conference on Foundations of Software Technology and theoretical Computer Science (FSTTCS), pp.316-331, 1990.

B. Awerbuch, S. Kutten, Y. Mansour, B. Patt-shamir, and G. Varghese, Time optimal self-stabilizing synchronization, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.652-661, 1993.
DOI : 10.1145/167088.167256

A. Bui, A. Kumar-datta, F. Petit, and V. Villain, State-optimal snap-stabilizing PIF in tree networks, Proceedings 19th IEEE International Conference on Distributed Computing Systems, pp.78-85, 1999.
DOI : 10.1109/SLFSTB.1999.777490

J. Burman and S. Kutten, Time Optimal Asynchronous Self-stabilizing Spanning Tree, 21st International Symposium on Distributed Computing (DISC), pp.92-107, 2007.
DOI : 10.1007/978-3-540-75142-7_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.7295

H. Nian-shing-chen, S. Yu, and . Huang, A self-stabilizing algorithm for constructing spanning trees, Information Processing Letters, vol.39, issue.3, pp.147-151, 1991.
DOI : 10.1016/0020-0190(91)90111-T

Z. Collin and S. Dolev, Self-stabilizing depth-first search, Information Processing Letters, vol.49, issue.6, pp.297-301, 1994.
DOI : 10.1016/0020-0190(94)90103-1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.1100

A. Cournier, Mémoire d'HabilitationàHabilitation`Habilitationà Diriger les Recherches : Graphes et algorithmique distribuée stabilisante, 2009.

A. Cournier, A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm, 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp.141-153, 2009.
DOI : 10.1109/71.588622

A. Cournier, S. Devismes, and V. Villain, A Snap-Stabilizing DFS with a Lower Space Requirement, 7th International Symposium on Self-Stabilizing Systems (SSS), pp.33-47
DOI : 10.1007/11577327_3

A. Cournier, S. Devismes, and V. Villain, Snap-stabilizing PIF and useless computations, 12th International Conference on Parallel and Distributed Systems, (ICPADS'06), pp.39-48, 2006.
DOI : 10.1109/ICPADS.2006.100

A. Cournier, S. Devismes, and V. Villain, Light enabling snap-stabilization of fundamental protocols, ACM Transactions on Autonomous and Adaptive Systems, vol.4, issue.1, 2009.
DOI : 10.1145/1462187.1462193

A. Kumar-datta, S. Gurumurthy, F. Petit, and V. Villain, Self-stabilizing network orientation algorithms in arbitrary rooted networks, Stud. Inform. Univ, vol.1, issue.1, pp.1-22, 2001.

A. Kumar-datta, L. L. Larmore, and P. Vemula, Self-Stabilizing Leader Election in Optimal Space, 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp.109-123, 2008.
DOI : 10.4086/cjtcs.1997.004

W. Edsger and . Dijkstra, Self-stabilizing systems in spite of distributed control, Commun. ACM, vol.17, issue.11, pp.643-644, 1974.

S. Dolev, A. Israeli, and S. Moran, Self-stabilization of dynamic systems assuming only read/write atomicity, 9th ACM symposium on Principles of distributed computing (PODC), pp.103-117, 1990.
DOI : 10.1007/BF02278851

C. Felix and . Gärtner, A survey of self-stabilizing spanning-tree construction algorithms, 2003.

. Shing-tsaan, N. Huang, and . Chen, A self-stabilizing algorithm for constructing breadthfirst trees, Inf. Process. Lett, vol.41, issue.2, pp.109-117, 1992.

C. Johnen, Memory efficient, self-stabilizing algorithm to construct BFS spanning trees, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing , PODC '97, pp.125-140, 1997.
DOI : 10.1145/259380.259508

C. Johnen and J. Beauquier, Distributed self-stabilizing depth-first token circulation with constant memory, 2nd Workshop on Self-Stabilizing System (WSS), pp.4-5, 1995.

A. Kosowski and L. Kuszner, A Self-stabilizing Algorithm for Finding a??Spanning Tree in a Polynomial Number of Moves, 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), pp.75-82, 2005.
DOI : 10.1007/11752578_10

G. Tel, Introduction to distributed algorithm, 2000.
DOI : 10.1017/CBO9781139168724