Fast Self-Stabilizing Depth-First Token Circulation

[1]  Amos Israeli,et al.  Uniform Dynamic Self-Stabilizing Leader Election , 1997, IEEE Trans. Parallel Distributed Syst..

[2]  Franck Petit,et al.  Optimality and Self-Stabilization in Rooted Tree Networks , 2000, Parallel Process. Lett..

[3]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[4]  Sukumar Ghosh.  An alternative solution to a problem on self-stabilization , 1993, TOPL.

[5]  Franck Petit,et al.  Color optimal self-stabilizing depth-first token circulation , 1997, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).

[6]  Vincent Villain,et al.  A Key Tool for Optimality in the State Model , 1999, WDAS.

[7]  Ajoy Kumar Datta,et al.  Self-Stabilizing Depth-First Token Passing on Rooted Networks , 1997, WDAG.

[8]  Franck Petit,et al.  Time and Space Optimality of Distributed Depth-First Token Circulation Algorithms , 1999, WDAS.

[9]  Mohamed G. Gouda,et al.  The Stabilizing Token Ring in Three Bits , 1996, J. Parallel Distributed Comput..

[10]  Amos Israeli,et al.  Self-stabilization of dynamic systems assuming only read/write atomicity , 1990, PODC '90.

[11]  Shlomi Dolev,et al.  Self-Stabilizing Depth-First Search , 1994, Inf. Process. Lett..

[12]  Shing-Tsaan Huang,et al.  A Self-Stabilizing Algorithm for Constructing Spanning Trees , 1991, Inf. Process. Lett..

[13]  Ajoy Kumar Datta,et al.  Self-stabilizing depth-first token circulation in arbitrary rooted networks , 2000, Distributed Computing.

[14]  Joffroy Beauquier,et al.  Space-Efficient, Distributed and Self-Stabilizing Depth-First Token Circulation , 1995 .