{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:26:33Z","timestamp":1775255193579,"version":"3.50.1"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319596464","type":"print"},{"value":"9783319596471","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59647-1_10","type":"book-chapter","created":{"date-parts":[[2017,5,13]],"date-time":"2017-05-13T02:53:30Z","timestamp":1494644010000},"page":"117-132","source":"Crossref","is-referenced-by-count":9,"title":["Oh-RAM! One and a Half Round Atomic Memory"],"prefix":"10.1007","author":[{"given":"Theophanis","family":"Hadjistasi","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Nicolaou","sequence":"additional","affiliation":[]},{"given":"Alexander A.","family":"Schwarzmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,14]]},"reference":[{"key":"10_CR1","unstructured":"NS3 network simulator. \nhttps:\/\/www.nsnam.org\/"},{"issue":"1","key":"10_CR2","doi-asserted-by":"crossref","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"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Dutta, P., Guerraoui, R., Levy, R.R., Chakraborty, A.: How fast can a distributed atomic read be? In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 236\u2013245 (2004)","DOI":"10.1145\/1011767.1011802"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-10877-8_20","volume-title":"Principles of Distributed Systems","author":"B Englert","year":"2009","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: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 240\u2013254. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-10877-8_20"},{"issue":"1","key":"10_CR5","doi-asserted-by":"crossref","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":"10_CR6","unstructured":"Hadjistasi, T., Nicolaou, N., Schwarzmann, A.A.: Oh-Ram! one and a half round atomic memory (2016). \narXiv:1610.08373"},{"key":"10_CR7","unstructured":"Hadjistasi, T., Nicolaou, N., Schwarzmann, A.A.: On the impossibility of one-and-a-half round atomic memory (2016). \nwww.arXiv.com"},{"issue":"3","key":"10_CR8","doi-asserted-by":"crossref","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":"10_CR9","doi-asserted-by":"crossref","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 program. IEEE Trans. Comput. 28(9), 690\u2013691 (1979)","journal-title":"IEEE Trans. Comput."},{"key":"10_CR10","volume-title":"Distributed Algorithms","author":"N Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)"},{"key":"10_CR11","doi-asserted-by":"crossref","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)","DOI":"10.1109\/FTCS.1997.614100"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59647-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,13]],"date-time":"2017-05-13T02:56:36Z","timestamp":1494644196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59647-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596464","9783319596471"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59647-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}