On Quiescent Reliable Communication, SIAM Journal on Computing, vol.29, issue.6, pp.2040-2073, 2000. ,
DOI : 10.1137/S0097539798341296
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
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
How fast can a distributed atomic read be?, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.236-245, 2004. ,
DOI : 10.1145/1011767.1011802
Fast Access to Distributed Atomic Memory, SIAM Journal on Computing, vol.39, issue.8, pp.3752-3783, 2010. ,
DOI : 10.1137/090757010
History Begins at Sumer: Thirty-Nine Firsts in Man's Recorded History, 1956. ,
On interprocess communication, Distributed Computing, vol.21, issue.2, pp.77-85, 1986. ,
DOI : 10.1007/BF01786227
Distributed algorithms, 1996. ,
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
Distributed algorithms for message-passing systems, p.2013 ,
DOI : 10.1007/978-3-642-38123-2
URL : https://hal.archives-ouvertes.fr/hal-00922219
Concurrent programming: algorithms, principles and foundations, p.2013 ,
DOI : 10.1007/978-3-642-32027-9
URL : https://hal.archives-ouvertes.fr/hal-00922217
On computable numbers with an application to the Entscheidungsproblem, Proc. of the, pp.230-265, 1936. ,
Quorum Systems: With Applications to Storage and Consensus, Synthesis Lectures on Distributed Computing Theory, vol.3, issue.1, p.2012 ,
DOI : 10.2200/S00402ED1V01Y201202DCT009