Z. Bouzid, M. G. Potop-butucaru, and S. Tixeuil, Byzantine Convergence in Robot Networks: The Price of Asynchrony, Principles of Distributed Systems, 13th International Conference, pp.54-70, 2009.
DOI : 10.1007/978-3-642-10877-8_7

B. Charron-bost, M. Függer, and T. Nowak, Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms, Automata, Languages, and Programming -42nd International Colloquium, ICALP 2015 Proceedings, Part II, pp.528-539, 2015.
DOI : 10.1007/978-3-662-47666-6_42
URL : https://hal.archives-ouvertes.fr/hal-01107422

C. Li, M. Hurfin, and Y. Wang, Approximate Byzantine consensus in sparse, mobile ad-hoc networks, Journal of Parallel and Distributed Computing, vol.74, issue.9, pp.2860-2871, 2014.
DOI : 10.1016/j.jpdc.2014.05.005
URL : https://hal.archives-ouvertes.fr/hal-01083553

L. Su and N. H. Vaidya, Reaching approximate byzantine consensus with multi-hop communication, Stabilization, Safety, and Security of Distributed Systems -17th International Symposium, SSS 2015, pp.21-35, 2015.

L. Tseng and N. H. Vaidya, Iterative Approximate Byzantine Consensus under a Generalized Fault Model, Distributed Computing and Networking, 14th International Conference, pp.72-86, 2013.
DOI : 10.1007/978-3-642-35668-1_6

N. H. Vaidya, L. Tseng, and G. Liang, Iterative approximate byzantine consensus in arbitrary directed graphs, Proceedings of the 2012 ACM symposium on Principles of distributed computing, PODC '12, pp.365-374, 2012.
DOI : 10.1145/2332432.2332505

D. Dolev, N. A. Lynch, S. S. Pinter, E. W. Stark, and W. E. , Reaching approximate agreement in the presence of faults, Journal of the ACM, vol.33, issue.3, pp.499-516, 1986.
DOI : 10.1145/5925.5931

R. M. Kieckhafer and M. H. Azadmanesh, Reaching approximate agreement with mixed-mode faults Parallel and Distributed Systems, IEEE Transactions on, vol.5, issue.1, pp.53-63, 1994.

N. A. Lynch, Distributed Algorithms, 1996.

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

M. J. Fischer, N. A. Lynch, and M. Merritt, Easy impossibility proofs for distributed consensus problems, Proceedings of the fourth annual ACM symposium on Principles of distributed computing , PODC '85, pp.26-39, 1986.
DOI : 10.1145/323596.323602

A. D. Fekete, Asymptotically optimal algorithms for approximate agreement, Distributed Computing, pp.9-29, 1990.

D. Stolz and R. Wattenhofer, Byzantine approximate agreement with median validity, 2015.

P. Berman, J. A. Garay, and K. J. Perry, Towards optimal distributed consensus (extended abstract), 30th Annual Symposium on Foundations of Computer Science, pp.410-415, 1989.

H. Mendes and M. Herlihy, Multidimensional approximate agreement in Byzantine asynchronous systems, Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, STOC '13, pp.391-400, 2013.
DOI : 10.1145/2488608.2488657

H. Mendes, M. Herlihy, N. H. Vaidya, and V. K. Garg, Multidimensional agreement in Byzantine systems, Distributed Computing, pp.423-441, 2015.
DOI : 10.1007/s00446-014-0240-5

M. Yung, The "Mobile Adversary" Paradigm in Distributed Computation and Systems, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC '15, pp.171-172, 2015.
DOI : 10.1145/2767386.2767453

F. Bonnet, X. Défago, T. D. Nguyen, and M. Potop-butucaru, Tight bound on mobile byzantine agreement, Distributed Computing -28th International Symposium, DISC 2014, pp.76-90, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01340236

H. Buhrman, J. A. Garay, and J. Hoepman, Optimal resiliency against mobile faults, Twenty-Fifth International Symposium on Fault-Tolerant Computing. Digest of Papers, pp.83-88, 1995.
DOI : 10.1109/FTCS.1995.466995

J. A. Garay, Reaching (and maintaining) agreement in the presence of mobile faults, Proceedings of the 8th International Workshop on Distributed Algorithms, pp.253-264, 1994.
DOI : 10.1007/BFb0020438

T. Sasaki, Y. Yamauchi, S. Kijima, and M. Yamashita, Mobile Byzantine Agreement on Arbitrary Network, Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS'13), pp.236-250, 2013.
DOI : 10.1007/978-3-319-03850-6_17

N. Banu, S. Souissi, T. Izumi, and K. Wada, An improved byzantine agreement algorithm for synchronous systems with mobile faults, International Journal of Computer Applications, vol.43, issue.22, pp.1-7, 2012.

R. Ostrovsky and M. Yung, How to withstand mobile virus attacks (extended abstract), Proceedings of the tenth annual ACM symposium on Principles of distributed computing , PODC '91, pp.51-59, 1991.
DOI : 10.1145/112600.112605

R. Reischuk, A new solution for the Byzantine generals problem, Information and Control, vol.64, issue.1-3, pp.23-42, 1985.
DOI : 10.1016/S0019-9958(85)80042-5