Local and Global Properties in Networks of Processes, Proc. 12th Symposium on Theory of Computing (STOC'80), pp.82-93, 1980. ,
Computing on an anonymous ring, Journal of the ACM, vol.35, issue.4, pp.845-875, 1988. ,
DOI : 10.1145/48014.48247
Distributed Computing, Fundamentals, Simulation and Advanced Topics, Wiley Series on Parallel and Distributed Computing, p.414, 2004. ,
Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement, Proc. 13th Int'l Conference on Principles of Distributed Systems (OPODIS'09), pp.285-299, 2009. ,
DOI : 10.1007/978-3-642-10877-8_23
The Price of Anonymity, Proc. 23th Int'l Symposium on Distributed Computing (DISC'09 Springer-Verlag LNCS #5805, pp.341-355, 2009. ,
DOI : 10.1145/2019591.2019592
URL : https://hal.archives-ouvertes.fr/inria-00348302
Looking for the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems: Is ${\it \Pi}_k$ the End of the Road?, Proc. 11th Int'l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'09), pp.149-164, 2009. ,
DOI : 10.1007/978-3-642-05118-0_11
A simple proof of the necessity of the failure detector ?? to implement an atomic register in asynchronous message-passing systems, Information Processing Letters, vol.110, issue.4, pp.153-157, 2010. ,
DOI : 10.1016/j.ipl.2009.11.011
URL : https://hal.archives-ouvertes.fr/inria-00543125
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
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
A Survey of Anonymous Peer-to-Peer File-Sharing, Proc. Satellite workshop of the Int'l Conference on Embedded and Ubiquitous Systems (EUS'05), pp.744-755, 2005. ,
DOI : 10.1007/11596042_77
A realistic look at failure detectors, Proceedings International Conference on Dependable Systems and Networks, pp.345-353, 2002. ,
DOI : 10.1109/DSN.2002.1028919
Shared Memory vs Message Passing, 2003. ,
The weakest failure detectors to solve certain fundamental problems in distributed computing, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.338-346, 2004. ,
DOI : 10.1145/1011767.1011818
The Weakest Failure Detector for Message Passing Set-Agreement, Proc. 22th Int'l Symposium on Distributed Computing Springer-Verlag LNCS #5218, pp.109-120, 2008. ,
DOI : 10.1007/978-3-540-87779-0_8
URL : https://hal.archives-ouvertes.fr/hal-00260000
Fault-Tolerant Consensus in Unknown and Anonymous Networks, 2009 29th IEEE International Conference on Distributed Computing Systems, pp.368-375, 2009. ,
DOI : 10.1109/ICDCS.2009.36
URL : https://hal.archives-ouvertes.fr/hal-00369280
A Hierarchical Anonymous Communication Protocol for Sensor Networks, Proc. Int'l Conference on Embedded and Ubiquitous Systems (EUS'05), pp.1123-1132, 2005. ,
DOI : 10.1007/11596356_111
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
Weighted voting for replicated data, Proceedings of the seventh symposium on Operating systems principles , SOSP '79, pp.150-172, 1979. ,
DOI : 10.1145/800215.806583
Every problem has a weakest failure detector, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.75-84, 2008. ,
DOI : 10.1145/1400751.1400763
How to Choose a Timing Model, IEEE Transactions on Parallel and Distributed Systems, vol.19, issue.10, pp.1367-1380, 2008. ,
DOI : 10.1109/TPDS.2008.16
Distributed computing on regular networks with anonymous nodes, IEEE Transactions on Computers, vol.43, issue.2, pp.211-218, 1994. ,
DOI : 10.1109/12.262125
Distributed Algorithms, 1996. ,
On the Computability Power and the Robustness of Set Agreementoriented Failure Detector Classes, Distributed Computing, pp.201-222, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00432977
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement, SIAM Journal on Computing, vol.38, issue.4, pp.1974-1601, 2008. ,
DOI : 10.1137/050645580
URL : https://hal.archives-ouvertes.fr/inria-00294706
Solving Consensus Using Chandra-Toueg???s Unreliable Failure Detectors: A General Quorum-Based Approach, Proc. 13th Int'l Symposium on Distributed Computing (DISC'99), pp.49-63, 1999. ,
DOI : 10.1007/3-540-48169-9_4
LEADER-BASED CONSENSUS, Parallel Processing Letters, vol.11, issue.01, pp.95-107, 2001. ,
DOI : 10.1142/S0129626401000452
Computing on an anonymous network, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.69-89, 1996. ,
DOI : 10.1145/62546.62568
Computing on an anonymous network, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.90-96, 1996. ,
DOI : 10.1145/62546.62568