M. Ben-or, D. Dolev, and E. N. Hoch, Fast self-stabilizing byzantine tolerant digital clock synchronization, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.385-394, 2008.
DOI : 10.1145/1400751.1400802
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.5423

A. Daliot and D. Dolev, Self-stabilization of Byzantine Protocols, Self-Stabilizing Systems, pp.48-67, 2005.
DOI : 10.1007/11577327_4

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

D. Dolev and E. N. Hoch, On Self-stabilizing Synchronous Actions Despite Byzantine Attacks, Lecture Notes in Computer Science, vol.4731, pp.193-207, 2007.
DOI : 10.1007/978-3-540-75142-7_17

S. Dolev, Self Stabilization, Journal of Aerospace Computing, Information, and Communication, vol.1, issue.6, 2000.
DOI : 10.2514/1.10141
URL : https://hal.archives-ouvertes.fr/inria-00627780

S. Dolev and J. L. Welch, Self-stabilizing clock synchronization in the presence of Byzantine faults, Journal of the ACM, vol.51, issue.5, pp.780-799, 2004.
DOI : 10.1145/1017460.1017463

S. Dubois, T. Masuzawa, and S. Tixeuil, Self-stabilization with byzantine tolerance for global tasks, p.5, 2010.

S. Dubois, T. Masuzawa, and S. Tixeuil, The Impact of Topology on Byzantine Containment in Stabilization, p.5, 2010.
DOI : 10.1007/978-3-642-15763-9_47
URL : https://hal.archives-ouvertes.fr/inria-00481836

B. Ducourthial and S. Tixeuil, Self-stabilization with r-operators. Distributed Computing, pp.147-162, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00632303

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

E. N. Hoch, D. Dolev, and A. Daliot, Self-stabilizing Byzantine Digital Clock Synchronization, pp.350-362
DOI : 10.1007/978-3-540-49823-0_25

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

L. Lamport, R. E. Shostak, and M. C. Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, pp.382-401, 1982.
DOI : 10.1145/357172.357176

T. Masuzawa and S. Tixeuil, Bounding the Impact of Unbounded Attacks in Stabilization, pp.440-453
DOI : 10.1007/978-3-540-49823-0_31
URL : https://hal.archives-ouvertes.fr/inria-00484645

T. Masuzawa and S. Tixeuil, Stabilizing link-coloration of arbitrary networks with unbounded byzantine faults, International Journal of Principles and Applications of Information Science and Technology (PAIST), vol.1, issue.1, pp.1-13, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01152556

M. Nesterenko and A. Arora, Tolerance to unbounded Byzantine faults, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings., p.22, 2002.
DOI : 10.1109/RELDIS.2002.1180170

Y. Sakurai, F. Ooshita, and T. Masuzawa, A Self-stabilizing Link-Coloring Protocol Resilient to Byzantine Faults in Tree Networks, Principles of Distributed Systems, 8th International Conference, pp.283-298, 2004.
DOI : 10.1007/11516798_21

S. Tixeuil, Algorithms and Theory of Computation Handbook, Second Edition, chapter Self-stabilizing Algorithms Chapman & Hall/CRC Applied Algorithms and Data Structures, pp.26-27, 2009.