The k-simultaneous consensus problem, Distributed Computing, vol.29, issue.5, pp.185-195, 2010. ,
DOI : 10.1007/s00446-009-0090-8
URL : https://hal.archives-ouvertes.fr/inria-00543100
Distributed Computing: Fundamentals, Simulations and Advanced Topics, p.414, 2004. ,
DOI : 10.1002/0471478210
Easy Impossibility Proofs for k-Set Agreement in Message-passing Systems, Brief Announcement, Proc. 30th ACM Symposium on Principles of Distributed Computing (PODC'11), 2010. ,
A simple proof of the necessity of the failure detector ?? to implement an atomic register in asynchronous message-passing systems, Information Processing Letters, vol.110, issue.4, pp.153-157, 2010. ,
DOI : 10.1016/j.ipl.2009.11.011
URL : https://hal.archives-ouvertes.fr/inria-00543125
On the Road to the Weakest Failure Detector for k-Set Agreement in Message-passing Systems, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00649311
-resilient asynchronous computations, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.91-100, 1993. ,
DOI : 10.1145/167088.167119
URL : https://hal.archives-ouvertes.fr/hal-00896459
Anti-? k × ? k )-Based k-Set Agreement Algorithms, Proc. 12th Int'l Conference on Principles of Distributed Systems (OPODIS'10), pp.190-205, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00519606
Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996. ,
DOI : 10.1145/226643.226647
The weakest failure detector for solving consensus, Journal of the ACM, vol.43, issue.4, pp.685-722, 1996. ,
DOI : 10.1145/234533.234549
More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems, Information and Computation, vol.105, issue.1, pp.132-158, 1993. ,
DOI : 10.1006/inco.1993.1043
Tight Failure Detection Bounds on Atomic Object Implementations, Journal of the ACM, vol.57, issue.22, 2010. ,
The Weakest Failure Detector for Message Passing Set-Agreement, Proc. 22th Int'l Symposium on Distributed Computing Springer-Verlag LNCS #5218, pp.109-120, 2008. ,
DOI : 10.1007/978-3-540-87779-0_8
URL : https://hal.archives-ouvertes.fr/hal-00260000
The weakest failure detector for solving k-set agreement, Proceedings of the 28th ACM symposium on Principles of distributed computing, PODC '09, pp.83-91, 2009. ,
DOI : 10.1145/1582716.1582735
The Alpha of Indulgent Consensus, The Computer Journal, vol.50, issue.1, pp.53-67, 2007. ,
DOI : 10.1093/comjnl/bxl046
The topological structure of asynchronous computability, Journal of the ACM, vol.46, issue.6, pp.858-923, 1999. ,
DOI : 10.1145/331524.331529
Using failure detectors to solve consensus in asynchronous shared-memory systems, Proc. 8th Int'l Workshop on Distributed Algorithms (WDAG'94 Springer-Verlag LNCS #857, pp.280-295, 1994. ,
DOI : 10.1007/BFb0020440
Distributed Algorithms, 1996. ,
k-set agreement with limited accuracy failure detectors, Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing , PODC '00, pp.143-152, 2000. ,
DOI : 10.1145/343477.343536
Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems, 2011. ,
DOI : 10.1007/978-3-642-24550-3_26
Failure Detectors and the Wait-free Hierarchy, 14th ACM Symposium on Principles of Distributed Computing (PODC'95, pp.100-109, 1995. ,
Encyclopedia of Algorithms, pp.829-831, 2008. ,
A short introduction to failure detectors for asynchronous distributed systems, ACM SIGACT News, vol.36, issue.1, pp.1181-1191, 2009. ,
DOI : 10.1145/1052796.1052806
Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, 2010. ,
DOI : 10.2200/S00236ED1V01Y201004DCT002
URL : https://hal.archives-ouvertes.fr/inria-00543036
Fault-tolerant Agreement in Synchronous Message-passing Systems, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, p.2010 ,
DOI : 10.2200/S00294ED1V01Y201009DCT003
URL : https://hal.archives-ouvertes.fr/inria-00543049
Failure Detectors to solve Asynchronous k-set Agreement: a Glimpse of Recent Results, The Bulletin of EATCS, vol.103, pp.75-95, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00536089
In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement, Proc. 10th Int'l Conference On Principles Of Distributed Systems (OPODIS'06 Springer-Verlag LNCS #4305, pp.1-17, 2006. ,
DOI : 10.1007/11945529_2
URL : https://hal.archives-ouvertes.fr/inria-00089977
-set agreement is impossible, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.1449-1483, 2000. ,
DOI : 10.1145/167088.167122
URL : https://hal.archives-ouvertes.fr/hal-00192526
Anti-Omega: the Weakest Failure Detector for Set Agreement, Proc. 27th ACM Symposium on Principles of Distributed Computing (PODC'08), pp.55-64, 2008. ,