Y. Afek and E. Gafni, Asynchrony from synchrony, Distributed Computing and Networking, ICDCN 2013, pp.225-239, 2013.

D. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, Why extension-based proofs fail, 2018.

M. Biely, P. Robinson, and M. Schmid, Ulrich Schwarz, and Kyrill Winkler. Gracefully degrading consensus and k-set agreement in directed dynamic networks, Theoretical Computer Science, vol.726, pp.41-77, 2018.

E. Borowsky and E. Gafni, Generalized FLP impossibility result for Tresilient asynchronous computations, Twenty-fifth Annual ACM Symposium on Theory of Computing, STOC '93, pp.91-100, 1993.

E. Borowsky and E. Gafni, Immediate atomic snapshots and fast renaming, Proceedings of the Twelfth Annual ACM Symposium on Principles of Distributed Computing, PODC '93, pp.41-51, 1993.

A. Castañeda, P. Fraigniaud, A. Paz, S. Rajsbaum, M. Roy et al., A topological perspective on distributed network algorithms, Structural Information and Communication Complexity, pp.3-18, 2019.

A. Castañeda and S. Rajsbaum, New combinatorial topology bounds for renaming: the lower bound. Distributed Computing, vol.22, pp.287-301, 2010.

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

B. Charron, -. Bost, and A. Schiper, The heard-of model: computing in distributed systems with benign faults, Distributed Computing, vol.22, issue.1, pp.49-71, 2009.

S. Chaudhuri, More choices allow more faults: Set consensus problems in totally asynchronous systems, Information and Computation, vol.105, issue.1, pp.132-158, 1993.

É. Coulouma, E. Godard, and J. Peters, A characterization of oblivious message adversaries for which consensus is solvable, Special Issue on Structural Information and Communication Complexity, vol.584, pp.80-90, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01198794

T. Elrad and N. Francez, Decomposition of distributed programs into communication-closed layers, Science of Computer Programming, vol.2, issue.3, pp.90013-90021, 1982.

P. Fraigniaud, A. Korman, and D. Peleg, Towards a complexity theory for local distributed computing, J. ACM, vol.60, issue.5, 2013.

E. Godard and E. Perdereau, k-set agreement in communication networks with omission faults, 20th International Conference on Principles of Distributed Systems (OPODIS 2016), vol.70, pp.1-8, 2017.

M. Herlihy, D. Kozlov, and S. Rajsbaum, Distributed Computing Through Combinatorial Topology, 2013.

M. Herlihy and S. Rajsbaum, The topology of distributed adversaries, Distributed Computing, vol.26, issue.3, pp.173-192, 2013.

M. Herlihy and N. Shavit, The asynchronous computability theorem for t-resilient tasks, Proceedings of the 25th ACM Symposium on Theory of Computing, pp.111-120, 1993.

M. Herlihy and N. Shavit, The topological structure of asynchronous computability, J. ACM, vol.46, issue.6, pp.858-923, 1999.

D. Jeanneau, T. Rieutord, L. Arantes, and P. Sens, Solving k-set agreement using failure detectors in unknown dynamic networks, IEEE Transactions on Parallel and Distributed Systems, vol.28, issue.5, pp.1484-1499, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01354864

N. Dmitry and . Kozlov, Combinatorial Algebraic Topology, Algorithms and computation in mathematics, vol.21, 2008.

F. Kuhn, N. Lynch, and R. Oshman, Distributed computation in dynamic networks, Proceedings of the Forty-second ACM Symposium on Theory of Computing, STOC '10, pp.513-522, 2010.

F. Kuhn, Y. Moses, and R. Oshman, Coordinated consensus in dynamic networks, Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC '11, pp.1-10, 2011.

L. Lamport, The part-time parliament, ACM Trans. Comput. Syst, vol.16, issue.2, pp.133-169, 1998.

T. Nowak, U. Schmid, and K. Winkler, Topological characterization of consensus under general message adversaries. PODC '19, pp.218-227, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02946833

D. Peleg, Distributed Computing: A Locality-sensitive Approach, Society for Industrial and Applied Mathematics, 2000.

M. Raynal and J. Stainer, Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors, Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, PODC '13, pp.166-175
URL : https://hal.archives-ouvertes.fr/hal-00920734

, , 2013.

M. Saks and F. Zaharoglou, Wait-free k-set agreement is impossible: The topology of public knowledge, SIAM J. Comput, vol.29, issue.5, pp.1449-1483, 2000.

A. Shimi and A. Castañeda, K set-agreement bounds in round-based models through combinatorial topology. CoRR, abs, 2003.
URL : https://hal.archives-ouvertes.fr/hal-02950742