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-00354248
Sharing Memory Robustly in Message Passing Systems, Journal of the ACM, vol.42, issue.1, pp.121-132, 1995. ,
On the road to the weakest failure detector for <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>k</mml:mi></mml:math>-set agreement in message-passing systems, Theoretical Computer Science, vol.412, issue.33, pp.4273-4284, 2011. ,
DOI : 10.1016/j.tcs.2010.11.007
-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), Springer LNCS 6490, pp.190-205, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00519606
Simultaneous Consensus is Harder than Set Agreement in Message-Passing, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00752610
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 (DISC'08), Springer LNCS 5218, pp.109-120, 2008. ,
DOI : 10.1007/978-3-540-87779-0_8
URL : https://hal.archives-ouvertes.fr/hal-00260000
On Set Consensus Numbers, Distributed Computing, pp.149-163, 2011. ,
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
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, Proc. 13th Int'l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'11), Springer LNCS 6976, pp.341-355, 2011. ,
DOI : 10.1007/978-3-642-24550-3_26
Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems, 2012 IEEE 11th International Symposium on Network Computing and Applications, pp.44-51, 2012. ,
DOI : 10.1109/NCA.2012.19
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, Bulletin of the EATCS, vol.103, pp.74-95, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00536089
Concurrent Programming: Algorithms, Principles, and Foundations, p.2013 ,
DOI : 10.1007/978-3-642-32027-9
URL : https://hal.archives-ouvertes.fr/hal-00922217
In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement, Proc. 10th Int'l Conf. on Principles of Distributed Systems (OPODIS'06), Springer LNCS 4305, pp.3-19, 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-01190520
Anti-Omega: the Weakest Failure Detector for Set Agreement, Proc. 27th ACM Symposium on Principles of Distributed Computing (PODC'08), pp.55-64, 2008. ,