Indulgent algorithms, PODC' 2000, pp.289-297, 2000. ,
URL : https://hal.archives-ouvertes.fr/hal-00992775
Consensus in the presence of partial synchrony, Journal of the ACM, vol.35, issue.2, pp.288-323, 1988. ,
DOI : 10.1145/42282.42283
The inherent price of indulgence, PODC '02: Proceedings of the annual ACM symposium on Principles of distributed computing, pp.88-97, 2002. ,
Fast Paxos, Distributed Computing, pp.79-103, 2006. ,
DOI : 10.1007/s00446-006-0005-x
Generalized consensus and paxos, 2005. ,
How to Solve Consensus in the Smallest Window of Synchrony, DISC, pp.32-46, 2008. ,
DOI : 10.1007/978-3-540-87779-0_3
Renaming in an asynchronous environment, Journal of the ACM, vol.37, issue.3, pp.524-548, 1990. ,
DOI : 10.1145/79147.79158
Wait-free implementations in message-passing systems, Theoretical Computer Science, vol.220, issue.1, pp.211-245, 1999. ,
DOI : 10.1016/S0304-3975(98)00242-4
The inherent price of indulgence, Distributed Computing, pp.85-98, 2005. ,
Of choices, failures and asynchrony: The many faces of set agreement, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00992777
Unreliable failure detectors for asynchronous systems (preliminary version), Proceedings of the tenth annual ACM symposium on Principles of distributed computing , PODC '91, pp.325-340, 1991. ,
DOI : 10.1145/112600.112627
Round-by-round fault detectors (extended abstract), Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing , PODC '98, 1998. ,
DOI : 10.1145/277697.277724
The overhead of consensus failure recovery, Distributed Computing, pp.373-386, 2007. ,
DOI : 10.1007/s00446-006-0017-6
The disagreement power of an adversary, DISC, pp.8-21, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00376981