Asynchrony from synchrony, Distributed Computing and Networking, ICDCN 2013, pp.225-239, 2013. ,
Why extension-based proofs fail, 2018. ,
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. ,
Generalized FLP impossibility result for Tresilient asynchronous computations, Twenty-fifth Annual ACM Symposium on Theory of Computing, STOC '93, pp.91-100, 1993. ,
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 topological perspective on distributed network algorithms, Structural Information and Communication Complexity, pp.3-18, 2019. ,
, New combinatorial topology bounds for renaming: the lower bound. Distributed Computing, vol.22, pp.287-301, 2010.
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
The heard-of model: computing in distributed systems with benign faults, Distributed Computing, vol.22, issue.1, pp.49-71, 2009. ,
More choices allow more faults: Set consensus problems in totally asynchronous systems, Information and Computation, vol.105, issue.1, pp.132-158, 1993. ,
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
Decomposition of distributed programs into communication-closed layers, Science of Computer Programming, vol.2, issue.3, pp.90013-90021, 1982. ,
Towards a complexity theory for local distributed computing, J. ACM, vol.60, issue.5, 2013. ,
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. ,
Distributed Computing Through Combinatorial Topology, 2013. ,
The topology of distributed adversaries, Distributed Computing, vol.26, issue.3, pp.173-192, 2013. ,
The asynchronous computability theorem for t-resilient tasks, Proceedings of the 25th ACM Symposium on Theory of Computing, pp.111-120, 1993. ,
The topological structure of asynchronous computability, J. ACM, vol.46, issue.6, pp.858-923, 1999. ,
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
Combinatorial Algebraic Topology, Algorithms and computation in mathematics, vol.21, 2008. ,
Distributed computation in dynamic networks, Proceedings of the Forty-second ACM Symposium on Theory of Computing, STOC '10, pp.513-522, 2010. ,
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. ,
The part-time parliament, ACM Trans. Comput. Syst, vol.16, issue.2, pp.133-169, 1998. ,
Topological characterization of consensus under general message adversaries. PODC '19, pp.218-227, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02946833
Distributed Computing: A Locality-sensitive Approach, Society for Industrial and Applied Mathematics, 2000. ,
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.
Wait-free k-set agreement is impossible: The topology of public knowledge, SIAM J. Comput, vol.29, issue.5, pp.1449-1483, 2000. ,
K set-agreement bounds in round-based models through combinatorial topology. CoRR, abs, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-02950742