A pleasant stroll through the land of infinitely many creatures, ACM SIGACT News, vol.35, issue.2, pp.36-59, 2004. ,
DOI : 10.1145/992287.992298
Stable Leader Election, Proc. 15th Int'l Symposium on Distributed Computing (DISC'01), pp.108-122, 2001. ,
DOI : 10.1007/3-540-45414-4_8
Communication-efficient leader election and consensus with limited link synchrony, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.328-337, 2004. ,
DOI : 10.1145/1011767.1011816
URL : https://hal.archives-ouvertes.fr/hal-00154865
On implementing omega in systems with weak reliability and synchrony assumptions, Distributed Computing, pp.285-314, 2008. ,
DOI : 10.1007/s00446-008-0068-y
Optimal Message-driven Implementations of Omega with Mute Processes, ACM Transactions on Autonomous and Adaptive Systems, vol.4, issue.4, 2009. ,
Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996. ,
DOI : 10.1145/226643.226647
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.498
The weakest failure detector for solving consensus, Journal of the ACM, vol.43, issue.4, pp.685-722, 1996. ,
DOI : 10.1145/234533.234549
Robust Stabilizing Leader Election, Proc. 9th Int'l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'07 Springer-Verlag LNCS #4838, pp.219-233, 2007. ,
DOI : 10.1007/978-3-540-76627-8_18
URL : https://hal.archives-ouvertes.fr/hal-00167935
Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony, International Conference on Dependable Systems and Networks (DSN'06), pp.166-175, 2006. ,
DOI : 10.1109/DSN.2006.34
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
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. ,
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
A General Characterization of Indulgence, ACM Transactions on Autonomous and Adaptive Systems, vol.3, issue.20, 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
Chasing the Weakest System Model for Implementing Ω and Consensus, IEEE Transactions on Dependable and Secure Computing, vol.6, issue.4, pp.269-281, 2009. ,
DOI : 10.1109/TDSC.2008.24
Optimal implementation of the weakest failure detector for solving consensus, Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000, pp.52-60, 2000. ,
DOI : 10.1109/RELDI.2000.885392
Leader Election and Stability without Eventual Timely Links, Proc. 19th Int'l Symposium on Distributed Computing (DISC'05), pp.199-213, 2005. ,
DOI : 10.1007/11561927_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.8257
A simple and communication-efficient Omega algorithm in the crash-recovery model, Information Processing Letters, vol.110, issue.3, pp.83-87, 2010. ,
DOI : 10.1016/j.ipl.2009.10.011
Implementing the Omega failure detector in the crash-recovery failure model, Journal of Computer and System Sciences, vol.75, issue.3, pp.178-189, 2009. ,
DOI : 10.1016/j.jcss.2008.10.002
Computing with Infinitely Many processes, Proc. 14th Int'l Symposium on Distributed Computing Springer-Verlag LNCS #1914, pp.164-178, 2000. ,
DOI : 10.1016/j.ic.2013.11.007
A Time-free Assumption to Implement Eventual Leadership. Parallel Processing letters, pp.189-208, 2006. ,
Time-free and timer-based assumptions can be combined to obtain eventual leadership, IEEE Transactions on Parallel and Distributed Systems, vol.17, issue.7, pp.656-666, 2006. ,
DOI : 10.1109/TPDS.2006.95
From Static Distributed Systems to Dynamic Systems, 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05), pp.109-118, 2005. ,
DOI : 10.1109/RELDIS.2005.19
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
Eventual Leader Election in Infinite Arrival Message-Passing System Model with Bounded Concurrency, 2010 European Dependable Computing Conference, pp.127-134, 2010. ,
DOI : 10.1109/EDCC.2010.24