D. Dolev, A. N. Lynch, S. Pinter, W. E. Stark, and E. W. , Reaching approximate agreement in the presence of faults, proc. of the IEEE symp. on reliability in distributed software and database systems, pp.145-154, 1983.
DOI : 10.1145/5925.5931

N. 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

H. Leblanc, H. Zhang, S. Sundaram, and X. Koutsoukos, Consensus of multi-agent networks in the presence of adversaries using only local information, Proceedings of the 1st international conference on High Confidence Networked Systems, HiCoNS '12, pp.1-10, 2012.
DOI : 10.1145/2185505.2185507

A. Jaffe, T. Moscibroda, and S. Sen, On the price of equivocation in byzantine agreement, Proceedings of the 2012 ACM symposium on Principles of distributed computing, PODC '12, pp.309-318, 2012.
DOI : 10.1145/2332432.2332491

M. Fitzi and U. Maurer, From partial consistency to global broadcast, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.494-503, 2000.
DOI : 10.1145/335305.335363

D. V. Ravikant, V. Muthuramakrishnan, V. Srikanth, K. Srinathan, and C. P. Rangan, On Byzantine Agreement over (2,3)-Uniform Hypergraphs, proc. of the Int. symp. on distributed computing, pp.450-464, 2005.
DOI : 10.1007/978-3-540-30186-8_32

M. Franklin and M. Yung, Secure hypergraphs, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing , STOC '95, pp.36-44, 1995.
DOI : 10.1145/225058.225077

M. H. Azadmanesh and H. Bajwa, Global convergence in partially fully connected networks (PFCN) with limited relays, proc. of the IEEE conf. on industrial electronics society, pp.2022-2025, 2001.

M. H. Azadmanesh and A. W. Krings, A step toward global convergence in partially connected networks, proc. of the Int. conf. on parallel and distributed computing systems, pp.234-241, 1997.

S. Sundaram and C. N. Hadjicostis, Distributed function calculation via linear iterations in the presence of malicious agents — Part I: Attacking the network, 2008 American Control Conference, pp.1350-1355, 2008.
DOI : 10.1109/ACC.2008.4586680

S. Sundaram and C. N. Hadjicostis, Distributed function calculation via linear iterations in the presence of malicious agents — Part II: Overcoming malicious behavior, 2008 American Control Conference, pp.1356-1361, 2008.
DOI : 10.1109/ACC.2008.4586681

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

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

I. Abraham, Y. Amit, and D. Dolev, Optimal Resilience Asynchronous Approximate Agreement, proc. of the Int. conf. on principles of distributed Systems, pp.229-239, 2005.
DOI : 10.1007/11516798_17

A. Clement, F. Junqueira, A. , and R. Rodrigues, On the (limited) power of non-equivocation, Proceedings of the 2012 ACM symposium on Principles of distributed computing, PODC '12, pp.301-308, 2012.
DOI : 10.1145/2332432.2332490

M. Backes, F. Bendun, A. Choudhury, and A. Kate, Asynchronous MPC with a strict honest majority using nonequivocation, proc. of the ACM symp. on principles of distributed computing, pp.10-19, 2014.