I. Abraham, Y. Amit, and D. Dolev, Optimal resilience asynchronous approximate agreement, 8th International Conference on Principles of Distributed Systems, vol.3544, pp.229-239, 2004.
DOI : 10.1007/11516798_17
URL : http://www.cs.huji.ac.il/~ittaia/papers/AAD-OPODIS04.pdf

M. Függer and T. Nowak, , vol.27, p.15

D. Angeli and P. Bliman, Stability of leaderless discrete-time multi-agent systems, MCSS, vol.18, issue.4, pp.293-322, 2006.

Z. Bouzid, M. G. Potop-butucaru, and S. Tixeuil, Optimal Byzantine-resilient convergence in uni-dimensional robot networks, Theoretical Computer Science, vol.411, pp.3154-3168, 2010.

S. Boyd and L. Vandenberghe, Convex optimization, 2004.

M. Cao, A. Stephen-morse, and B. D. Anderson, Reaching a consensus in a dynamically changing environment: convergence rates, measurement delays, and asynchronous events, SIAM J. Control Optim, vol.47, issue.2, pp.601-623, 2008.
DOI : 10.1137/060657029
URL : https://pure.rug.nl/ws/files/2701367/2008SIAMJContrOpt2Cao.pdf

B. Charron-bost, M. Függer, and T. Nowak, Approximate consensus in highly dynamic networks: The role of averaging algorithms, Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, vol.15, pp.528-539, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01107422

B. Charron-bost, M. Függer, and T. Nowak, Fast, robust, quantizable approximate consensus, Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, vol.16, pp.1-137, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01395576

B. Charron-bost, M. Függer, and T. Nowak, Multidimensional asymptotic consensus in dynamic networks, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01789019

B. Charron, -. , and A. Schiper, The Heard-Of model: computing in distributed systems with benign faults, Distrib. Comput, vol.22, issue.1, pp.49-71, 2009.

B. Chazelle, The total s-energy of a multiagent system, SIAM Journal on Control and Optimization, vol.49, issue.4, pp.1680-1706, 2011.

M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro, Solving the robots gathering problem, International Colloquium on Automata, Languages, and Programming, pp.1181-1196, 2003.
DOI : 10.1007/3-540-45061-0_90
URL : http://www.scs.carleton.ca/~santoro/Reports/Robots-ICALP.pdf

L. Danzer, B. Grünbaum, and V. Klee, Helly's theorem and its relatives, of Proceedings of Symposia in Pure Mathematics, vol.7, pp.101-180, 1963.
DOI : 10.1090/pspum/007/0157289

D. Dolev, N. A. Lynch, S. S. Pinter, E. W. Stark, and W. E. Weihl, Reaching approximate agreement in the presence of faults, Journal of the ACM, vol.33, issue.2, pp.499-516, 1986.

A. D. Fekete, Asymptotically optimal algorithms for approximate agreement, Distrib. Comput, vol.4, issue.1, pp.9-29, 1990.
DOI : 10.1145/10590.10597

M. Függer, T. Nowak, and M. Schwarz, Tight bounds for asymptotic and approximate consensus, Symposium on Principles of Distributed Computing (PODC), 2018.

Q. Li and D. Rus, Global clock synchronization in sensor networks, IEEE Transactions on Computers, vol.55, issue.2, pp.214-226, 2006.

N. A. Lynch, Distributed Algorithms, 1996.

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

L. Moreau, Stability of multiagent systems with time-dependent communication links, IEEE Transactions on Automatic Control, vol.50, issue.2, pp.169-182, 2005.
DOI : 10.1109/tac.2004.841888

R. Olfati, -. Saber, and R. Murray, Consensus problems in networks of agents with switching topology and time-delays, IEEE Transactions on automatic control, vol.49, issue.9, pp.1520-1533, 2004.

L. A. Rademacher, Approximating the centroid is hard, Proceedings of the Twentythird Annual Symposium on Computational Geometry, pp.302-305, 2007.
DOI : 10.1145/1247069.1247123