{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T23:22:18Z","timestamp":1784676138979,"version":"3.55.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:00:00Z","timestamp":1590451200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:00:00Z","timestamp":1590451200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100010665","name":"H2020 Marie Sklodowska-Curie Actions","doi-asserted-by":"publisher","award":["AtomicDFS (629088)"],"award-info":[{"award-number":["AtomicDFS (629088)"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The Regional Government of Madrid","award":["Cloud4BigData (S2013\/ICE-2894)"],"award-info":[{"award-number":["Cloud4BigData (S2013\/ICE-2894)"]}]},{"name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","award":["DiscoEdge (TIN2017-88749-R)"],"award-info":[{"award-number":["DiscoEdge (TIN2017-88749-R)"]}]},{"name":"EU Commission H2020","award":["RECAP (RIA 732667)"],"award-info":[{"award-number":["RECAP (RIA 732667)"]}]},{"DOI":"10.13039\/501100001809","name":"NSF of China","doi-asserted-by":"crossref","award":["61520106005"],"award-info":[{"award-number":["61520106005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001810","name":"Research Promotion Foundation","doi-asserted-by":"crossref","award":["POST-DOC\/0916\/0090"],"award-info":[{"award-number":["POST-DOC\/0916\/0090"]}],"id":[{"id":"10.13039\/501100001810","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s00446-020-00379-y","type":"journal-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T17:03:28Z","timestamp":1590512608000},"page":"33-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Tractable low-delay atomic memory"],"prefix":"10.1007","volume":"34","author":[{"given":"Antonio Fern\u00e1ndez","family":"Anta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Theophanis","family":"Hadjistasi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7540-784X","authenticated-orcid":false,"given":"Nicolas","family":"Nicolaou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander A.","family":"Schwarzmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,5,26]]},"reference":[{"issue":"1","key":"379_CR1","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H Attiya","year":"1996","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message passing systems. J. ACM 42(1), 124\u2013142 (1996)","journal-title":"J. ACM"},{"issue":"8","key":"379_CR2","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.R., Vukoli\u0107, M.: Fast access to distributed atomic memory. SIAM J. Comput. 39(8), 3752\u20133783 (2010)","journal-title":"SIAM J. Comput."},{"key":"379_CR3","doi-asserted-by":"crossref","unstructured":"Englert, B., Georgiou, C., Musial, P.M., Nicolaou, N., Shvartsman, A.A.: On the efficiency of atomic multi-reader, multi-writer distributed memory. In: Proceedings 13th International Conference On Principle Of DIstributed Systems (OPODIS 09), pp. 240\u2013254 (2009)","DOI":"10.1007\/978-3-642-10877-8_20"},{"key":"379_CR4","unstructured":"Fern\u00e1ndez\u00a0Anta, A., Nicolaou, N., Popa, A.: Making \u201cfast\u201d atomic operations computationally tractable. In Proceedings 19th International Conference on Principle of Distributed Systems (OPODIS 15) (2015)"},{"key":"379_CR5","unstructured":"Fern\u00e1ndez\u00a0Anta, A., Hadjistasi, T., Nicolaou, N.: Computationally light \u201cmulti-speed\u201d atomic memory. In: International Conference on Principles Of Distributed Systems, OPODIS\u201916 (2016)"},{"key":"379_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. In: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA. ISBN: 0716710455 (1990)"},{"key":"379_CR7","unstructured":"Georgiou, C., Kentros, S., Nicolaou, N.C., Shvartsman, A.A.: Analyzing the number of slow reads for semifast atomic read\/write register implementations. In: Proceedings Parallel and Distributed Computing and Systems (PDCS09), pp. 229\u2013236 (2009)"},{"key":"379_CR8","doi-asserted-by":"crossref","unstructured":"Georgiou, C., Nicolaou, N., Russel, A., Shvartsman, A.A.: Towards feasible implementations of low-latency multi-writer atomic registers. In: 10th Annual IEEE International Symposium on Network Computing and Applications (2011)","DOI":"10.1109\/NCA.2011.18"},{"key":"379_CR9","doi-asserted-by":"crossref","unstructured":"Georgiou, C., Nicolaou, N.C., Shvartsman, A.A.: On the robustness of (semi) fast quorum-based implementations of atomic shared memory. In: DISC \u201908: Proceedings of the 22nd International Symposium on Distributed Computing, pp. 289\u2013304. Springer, Berlin, Heidelberg (2008)","DOI":"10.1145\/1400751.1400817"},{"issue":"1","key":"379_CR10","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jpdc.2008.05.004","volume":"69","author":"C Georgiou","year":"2009","unstructured":"Georgiou, C., Nicolaou, N.C., Shvartsman, A.A.: Fault-tolerant semifast implementations of atomic read\/write registers. J. Parallel Distrib. Comput. 69(1), 62\u201379 (2009)","journal-title":"J. Parallel Distrib. Comput."},{"key":"379_CR11","doi-asserted-by":"crossref","unstructured":"Hadjistasi, T., Nicolaou, N., Schwarzmann, A.A.: Brief announcement: oh-ram! one and a half round read\/write atomic memory. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC \u201916, pp. 353\u2013355. ACM, New York, NY, USA (2016)","DOI":"10.1145\/2933057.2933073"},{"key":"379_CR12","doi-asserted-by":"crossref","unstructured":"Hadjistasi, T., Nicolaou, N.C., Schwarzmann, A.A.: Oh-ram! one and a half round atomic memory. In: Networked Systems\u20145th International Conference, NETYS 2017, Marrakech, Morocco, May 17-19, 2017, Proceedings, pp. 117\u2013132 (2017)","DOI":"10.1007\/978-3-319-59647-1_10"},{"issue":"3","key":"379_CR13","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. (TOPLAS) 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"issue":"9","key":"379_CR14","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"28","author":"L Lamport","year":"1979","unstructured":"Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess progranm. IEEE Trans. Comput. 28(9), 690\u2013691 (1979)","journal-title":"IEEE Trans. Comput."},{"key":"379_CR15","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers, Burlington (1996)"},{"key":"379_CR16","unstructured":"Lynch, N.A., Shvartsman, A.A.: Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In: Proceedings of Symposium on Fault-Tolerant Computing, pp. 272\u2013281 (1997)"},{"key":"379_CR17","unstructured":"NS3 network simulator. https:\/\/www.nsnam.org\/"},{"issue":"12","key":"379_CR18","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.ipl.2012.03.007","volume":"112","author":"EC Xavier","year":"2012","unstructured":"Xavier, E.C.: A note on a maximum k-subset intersection problem. Inf. Process. Lett. 112(12), 471\u2013472 (2012)","journal-title":"Inf. Process. Lett."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-020-00379-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-020-00379-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-020-00379-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T23:35:16Z","timestamp":1621985716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-020-00379-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,26]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["379"],"URL":"https:\/\/doi.org\/10.1007\/s00446-020-00379-y","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,26]]},"assertion":[{"value":"10 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}