{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:35Z","timestamp":1759638575632,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,5,9]],"date-time":"2018-05-09T00:00:00Z","timestamp":1525824000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"DFG-ANR","award":["40300781"],"award-info":[{"award-number":["40300781"]}]},{"name":"ANR","award":["ANR-16-CE40-0023-03"],"award-info":[{"award-number":["ANR-16-CE40-0023-03"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s00607-018-0615-8","type":"journal-article","created":{"date-parts":[[2018,5,9]],"date-time":"2018-05-09T10:15:29Z","timestamp":1525860929000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Time-efficient read\/write register in crash-prone asynchronous message-passing systems"],"prefix":"10.1007","volume":"101","author":[{"given":"Achour","family":"Most\u00e9faoui","sequence":"first","affiliation":[]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6336-4667","authenticated-orcid":false,"given":"Matthieu","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,9]]},"reference":[{"issue":"6","key":"615_CR1","doi-asserted-by":"publisher","first-page":"2040","DOI":"10.1137\/S0097539798341296","volume":"29","author":"MK Aguilera","year":"2000","unstructured":"Aguilera MK, Chen W, Toueg S (2000) On quiescent reliable communication. SIAM J Comput 29(6):2040\u20132073","journal-title":"SIAM J Comput"},{"issue":"1","key":"615_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/200836.200869","volume":"42","author":"H Attiya","year":"1995","unstructured":"Attiya H, Bar-Noy A, Dolev D (1995) Sharing memory robustly in message passing systems. J ACM 42(1):121\u2013132","journal-title":"J ACM"},{"key":"615_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed computing: fundamentals, simulations and advanced topics","author":"H Attiya","year":"2004","unstructured":"Attiya H, Welch J (2004) Distributed computing: fundamentals, simulations and advanced topics, 2nd edn. Wiley, Hoboken","edition":"2"},{"key":"615_CR4","doi-asserted-by":"crossref","unstructured":"Dutta P, Guerraoui R, Levy R, Chakraborty A (2004) How fast can a distributed atomic read be? In: Proceedings of 23rd ACM symposium on principles of distributed computing (PODC\u201904 ), ACM Press, pp 236\u2013245","DOI":"10.1145\/1011767.1011802"},{"issue":"8","key":"615_CR5","doi-asserted-by":"publisher","first-page":"3752","DOI":"10.1137\/090757010","volume":"39","author":"P Dutta","year":"2010","unstructured":"Dutta P, Guerraoui R, Levy R, Vukolic M (2010) Fast access to distributed atomic memory. SIAM J Comput 39(8):3752\u20133783","journal-title":"SIAM J Comput"},{"issue":"3","key":"615_CR6","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy MP, Wing JM (1990) Linearizability: a correctness condition for concurrent objects. ACM Trans Program Lang Syst 12(3):463\u2013492","journal-title":"ACM Trans Program Lang Syst"},{"key":"615_CR7","doi-asserted-by":"crossref","unstructured":"Hadjistasi T, Nicolaou N, Schwarzmann AA (2017) Oh-RAM! One and a half round atomic memory. In: Proceedings of 5th international conference on networked systems (NETYS\u201917), Springer LNCS 10299, pp 117\u2013132","DOI":"10.1007\/978-3-319-59647-1_10"},{"key":"615_CR8","isbn-type":"print","volume-title":"History begins at sumer: thirty-nine firsts in man\u2019s recorded history","author":"SN Kramer","year":"1956","unstructured":"Kramer SN (1956) History begins at sumer: thirty-nine firsts in man\u2019s recorded history. University of Pennsylvania Press, Philadelphia. ISBN 978-0-8122-1276-1","ISBN":"https:\/\/id.crossref.org\/isbn\/9780812212761"},{"issue":"2","key":"615_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L Lamport","year":"1986","unstructured":"Lamport L (1986) On interprocess communication. Part I: basic formalism. Distrib Comput 1(2):77\u201385","journal-title":"Distrib Comput"},{"key":"615_CR10","isbn-type":"print","volume-title":"Distributed algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch NA (1996) Distributed algorithms. Morgan Kaufmann Publishers Inc., San Francisco, CA. ISBN 978-1-55860-384-4","ISBN":"https:\/\/id.crossref.org\/isbn\/9781558603844"},{"key":"615_CR11","unstructured":"Most\u00e9faoui A, Raynal M (2026) Two-bit messages are sufficient to implement atomic read\/write registers in crash-prone systems. In: Proceedings of 35th ACM symposium on principles of distributed computing (PODC\u201916), ACM Press, pp 381\u2013390"},{"key":"615_CR12","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38123-2","volume-title":"Distributed algorithms for message-passing systems","author":"M Raynal","year":"2013","unstructured":"Raynal M (2013) Distributed algorithms for message-passing systems. Springer, Heilderberg. ISBN 978-3-642-38122-5","ISBN":"https:\/\/id.crossref.org\/isbn\/9783642381225"},{"key":"615_CR13","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32027-9","volume-title":"Concurrent programming: algorithms, principles and foundations","author":"M Raynal","year":"2013","unstructured":"Raynal M (2013) Concurrent programming: algorithms, principles and foundations. Springer, Heilderberg. ISBN 978-3-642-32026-2","ISBN":"https:\/\/id.crossref.org\/isbn\/9783642320262"},{"key":"615_CR14","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1007\/978-3-319-94141-7","volume-title":"Fault-tolerant message-passing distributed systems: an algorithmic approach","author":"M Raynal","year":"2018","unstructured":"Raynal M (2018) Fault-tolerant message-passing distributed systems: an algorithmic approach. Springer, Berlin, p 550"},{"key":"615_CR15","first-page":"230","volume":"42","author":"AM Turing","year":"1936","unstructured":"Turing AM (1936) On computable numbers with an application to the Entscheidungsproblem. Proc Lond Math Soc 42:230\u2013265","journal-title":"Proc Lond Math Soc"},{"key":"615_CR16","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02007-0","volume-title":"Quorum systems, with applications to storage and consensus","author":"M Vukolic","year":"2012","unstructured":"Vukolic M (2012) Quorum systems, with applications to storage and consensus. Morgan & Claypool Publishers, San Rafael. ISBN 978-1-60845-683-3","ISBN":"https:\/\/id.crossref.org\/isbn\/9781608456833"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-018-0615-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0615-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0615-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T22:49:21Z","timestamp":1661208561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-018-0615-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,9]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["615"],"URL":"https:\/\/doi.org\/10.1007\/s00607-018-0615-8","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2018,5,9]]},"assertion":[{"value":"3 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}