H. Attiya, 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

H. Attiya, Robust simulation of shared memory: 20 years after, Bulletin of the EATCS, vol.100, pp.99-113, 2010.

H. Attiya, A. Bar-noy, and D. Dolev, Sharing memory robustly in message passing systems, Journal of the ACM, vol.42, issue.1, pp.121-132, 1995.

H. Attiya and J. Welch, Distributed computing: fundamentals, simulations and advanced topics, p.414, 2004.
DOI : 10.1002/0471478210

B. Awerbuch, Complexity of network synchronization, Journal of the ACM, vol.32, issue.4, pp.804-823, 1985.
DOI : 10.1145/4221.4227

K. A. Bartlett, S. A. Scantlebury, and P. T. Wilkinson, A note on reliable full-duplex transmission over half-duplex links, Communications of the ACM, vol.12, issue.5, pp.260-261, 1969.
DOI : 10.1145/362946.362970

M. P. Herlihy and J. M. Wing, 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

A. Israeli and M. Li, Bounded time-stamps, Distributed Computing, pp.205-209, 1993.

S. N. Kramer, History Begins at Sumer: Thirty-Nine Firsts in Man's Recorded History, 1956.

L. Lamport, On interprocess communication, Distributed Computing, vol.21, issue.2, pp.77-85, 1986.
DOI : 10.1007/BF01786227
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.1038

L. Lamport, On interprocess communication, Distributed Computing, vol.5, issue.2, pp.86-101, 1986.
DOI : 10.1007/BF01786228
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.1038

N. A. Lynch, Distributed algorithms, 1996.

W. C. Lynch, Computer Systems: Reliable full-duplex file transmission over half-duplex telephone line, Communications of the ACM, vol.11, issue.6, pp.407-410, 1968.
DOI : 10.1145/363347.363366

J. Misra, Axioms for memory access in asynchronous hardware systems, ACM Transactions on Programming Languages and Systems, vol.8, issue.1, pp.142-153, 1986.
DOI : 10.1145/5001.5007

A. Mostéfaoui and M. Raynal, Time-efficient read/write register in crash-prone asynchronous messagepassing systems, 2016.

M. Raynal, 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

M. Raynal, Distributed algorithms for message-passing systems, 2013.
DOI : 10.1007/978-3-642-38123-2
URL : https://hal.archives-ouvertes.fr/hal-00922219

M. Raynal, Concurrent programming: algorithms, principles and foundations, 2013.
DOI : 10.1007/978-3-642-32027-9
URL : https://hal.archives-ouvertes.fr/hal-00922217

E. Ruppert, Implementing shared registers in asynchronous message-passing systems. Springer Encyclopedia of Algorithms, pp.400-403, 2008.

A. M. Turing, On computable numbers with an application to the Entscheidungsproblem, Proc. of the, pp.230-265, 1936.

P. M. Vitányi and B. Awerbuch, Atomic shared register access by asynchronous hardware (Detailed abstract), Proc. 27th Annual Symposium on Foundations of Computer Science (FOCS'86, pp.233-243, 1986.

M. Vukolic, Quorum Systems: With Applications to Storage and Consensus, Synthesis Lectures on Distributed Computing Theory, vol.3, issue.1, p.2012
DOI : 10.2200/S00402ED1V01Y201202DCT009