Efficient and Robust Sharing of Memory in Message-Passing Systems, Journal of Algorithms, vol.34, issue.1, pp.109-127, 2000. ,
DOI : 10.1006/jagm.1999.1025
Sharing Memory Robustly in Message Passing Systems, Journal of the ACM, vol.42, issue.1, pp.121-132, 1995. ,
Distributed Computing: Fundamentals, Simulations and Advanced Topics, p.414, 2004. ,
DOI : 10.1002/0471478210
Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996. ,
DOI : 10.1145/226643.226647
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
Asynchronous bounded lifetime failure detectors, Information Processing Letters, vol.94, issue.2, pp.85-91, 2005. ,
DOI : 10.1016/j.ipl.2004.12.011
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
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 Interprocess communication. Part I: Formalism. Part II: Algorithms. Distributed Computing, pp.87-103, 1986. ,
Distributed Algorithms, 1996. ,