Long-lived adaptive collect with applications, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), pp.262-272, 1999. ,
DOI : 10.1109/SFFCS.1999.814598
An adaptive collect algorithm with applications, Distributed Computing, vol.15, issue.2, pp.87-96, 2002. ,
DOI : 10.1007/s004460100067
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.8262
The weakest failure detector for solving consensus, Journal of the ACM, vol.43, issue.4, pp.685-722, 1996. ,
DOI : 10.1145/234533.234549
Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996. ,
DOI : 10.1145/226643.226647
Two Consensus Algorithms with Atomic Registers and Failure Detector ??, Proc. 10th Int'l Conference on Distributed Computing and Networking (ICDCN'09), pp.251-262, 2009. ,
DOI : 10.1016/S0020-0190(00)00027-2
Fast Collect in the absence of contention, Proceedings 22nd International Conference on Distributed Computing Systems, pp.537-543, 2002. ,
DOI : 10.1109/ICDCS.2002.1022303
A Timing Assumption and Two t-Resilient Protocols for??Implementing an Eventual Leader Service in??Asynchronous Shared Memory Systems, Algorithmica, vol.36, issue.1, pp.550-576, 2010. ,
DOI : 10.1007/s00453-008-9190-2
Impossibility of distributed consensus with one faulty process, Journal of the ACM, vol.32, issue.2, pp.374-382, 1985. ,
DOI : 10.1145/3149.214121
Round-by-round fault detectors: unifying synchrony and asynchrony, Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC'98), pp.143-152, 1998. ,
DOI : 10.1145/277697.277724
The weakest failure detectors to boost obstruction-freedom. Distributed Computing, pp.415-433, 2008. ,
The information structure of indulgent consensus, IEEE Transactions on Computers, vol.53, issue.4, pp.453-466, 2004. ,
DOI : 10.1109/TC.2004.1268403
The Alpha of Indulgent Consensus, The Computer Journal, vol.50, issue.1, pp.53-67, 2007. ,
DOI : 10.1093/comjnl/bxl046
Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.124-149, 1991. ,
DOI : 10.1145/114005.102808
Linearizability: a correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems, vol.12, issue.3, pp.463-492, 1990. ,
DOI : 10.1145/78969.78972
On the cost of fault-tolerant consensus when there are no faults, ACM SIGACT News, vol.32, issue.2, pp.45-63, 2001. ,
DOI : 10.1145/504192.504195
The part-time parliament, ACM Transactions on Computer Systems, vol.16, issue.2, pp.133-169, 1998. ,
DOI : 10.1145/279227.279229
Using failure detectors to solve consensus in asynchronous shared-memory systems, Proc. 8th Int'l Workshop on Distributed Algorithms (WDAG'94), pp.280-295, 1994. ,
DOI : 10.1007/BFb0020440
Memory requirements for for agreement among Unreliable Asynchronous processes, Advances in Computing Research, pp.163-183, 1987. ,
Leader-based consensus. Parallel Processing Letters, pp.95-107, 2001. ,
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
Concurrent programming: algorithms, principles and foundations. To appear, pp.420-2012 ,
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 Conference On Principles Of Distributed Systems (OPODIS'11), pp.3-19, 2006. ,
DOI : 10.1007/11945529_2
URL : https://hal.archives-ouvertes.fr/inria-00089977