Asynchrony from Synchrony, Proc. Int'l Conference on Distributed Computing and Networking (ICDCN'13), Springer LNCS 7730, pp.225-239, 2013. ,
DOI : 10.1007/978-3-642-35668-1_16
URL : http://arxiv.org/abs/1203.6096
A king in two tournaments Unpublished report, 3 pages, 2012. ,
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
The Heard-Of model: computing in distributed systems with benign faults, Distributed Computing, vol.384, issue.3, pp.49-71, 2009. ,
DOI : 10.1007/s00446-009-0084-6
Failure Detectors as Schedulers (Brief Announcement), Proc. 26th ACM Symposium on Principles of Distributed Computing (PODC), pp.308-309, 2007. ,
DOI : 10.1145/1281100.1281146
Tight failure detection bounds on atomic object implementations, Journal of the ACM, vol.57, issue.22, 2010. ,
The minimum information about failures for solving non-local tasks in message-passing systems, Distributed Computing, vol.22, issue.5???6, pp.255-269, 2011. ,
DOI : 10.1007/s00446-011-0146-4
From an Asynchronous Intermittent Rotating Star to an Eventual Leader, IEEE Transactions on Parallel and Distributed Systems, vol.21, issue.9, pp.1290-1303, 2010. ,
DOI : 10.1109/TPDS.2009.163
Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.124-149, 1991. ,
DOI : 10.1145/114005.102808
The topological structure of asynchronous computability, Journal of the ACM, vol.46, issue.6, pp.858-923, 1999. ,
DOI : 10.1145/331524.331529
Distributed computation in dynamic networks, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.513-522, 2010. ,
DOI : 10.1145/1806689.1806760
On dominance relations and the structure of animal societies: III The condition for a score structure, The Bulletin of Mathematical Biophysics, vol.2, issue.2, pp.143-148, 1953. ,
DOI : 10.1007/BF02476378
Using failure detectors to solve consensus in asynchronous shared-memory systems, Proc. 8th Int'l Workshop on Distributed Algorithms (WDAG'94), Springer LNCS 857, pp.280-295, 1994. ,
DOI : 10.1007/BFb0020440
Asynchronous implementation of failure detectors, Proc. Int'l IEEE Conference on Dependable Systems and Networks, pp.351-360, 2003. ,
Failure detectors encapsulate fairness, Distributed Computing, vol.21, issue.3, pp.313-333, 2012. ,
DOI : 10.1007/s00446-012-0164-x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.178.5842
The Iterated Restricted Immediate Snapshot Model, Proc. 14th Annual Int'l Conference on Computing and Combinatorics (COCOON 2008), Springer LNCS 5092, pp.487-497, 2008. ,
DOI : 10.1007/978-3-540-69733-6_48
URL : https://hal.archives-ouvertes.fr/hal-00829436
Rump session, 2007. ,
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
Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors, Proc. 19th Int'l Colloquium on Structural Information and Communication Complexity (SIROCCO'12), Springer LNCS 7355, pp.231-242, 2012. ,
DOI : 10.1007/978-3-642-31104-8_20
URL : https://hal.archives-ouvertes.fr/hal-00670154
Time is not a healer, Proc. 6th Annual Symposium on Theoretical Aspects of Computer Science (STACS'89), Springer LNCS 349, pp.304-316, 1989. ,
DOI : 10.1007/BFb0028994
Agreement in synchronous networks with ubiquitous faults, Theoretical Computer Science, vol.384, issue.2-3, pp.232-249, 2007. ,
DOI : 10.1016/j.tcs.2007.04.036
Impossibility Results and Lower Bounds for Consensus under Link Failures, SIAM Journal on Computing, vol.38, issue.5, pp.1912-1951, 2009. ,
DOI : 10.1137/S009753970443999X
Anti-Omega: the weakest failure detector for set agreement, Proc. 27th ACM Symposium on Principles of Distributed Computing (PODC), pp.55-64, 2008. ,