{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:48Z","timestamp":1750307508302,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T00:00:00Z","timestamp":1249948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,8,11]]},"DOI":"10.1145\/1583991.1584003","type":"proceedings-article","created":{"date-parts":[[2009,8,17]],"date-time":"2009-08-17T18:34:59Z","timestamp":1250534099000},"page":"43-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["At-most-once semantics in asynchronous shared memory"],"prefix":"10.1145","author":[{"given":"Sotirios","family":"Kentros","sequence":"first","affiliation":[{"name":"University of Connecticut, Storrs, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aggelos","family":"Kiayias","sequence":"additional","affiliation":[{"name":"University of Connecticut, Storrs, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Nicolaou","sequence":"additional","affiliation":[{"name":"University of Connecticut, Storrs, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander A.","family":"Shvartsman","sequence":"additional","affiliation":[{"name":"University of Connecticut, Storrs, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2080.357392"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_18"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008930"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/103720.103722"},{"key":"e_1_3_2_1_5_1","volume-title":"Distributed Algorithms","author":"Lynch N. A.","year":"1996","unstructured":"N. A. Lynch . Distributed Algorithms . Morgan Kaufmann Publishers , 1996 . N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996."}],"event":{"name":"SPAA 09: 21st ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Calgary AB Canada","acronym":"SPAA 09"},"container-title":["Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1583991.1584003","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1583991.1584003","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:57Z","timestamp":1750249077000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1583991.1584003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,11]]},"references-count":5,"alternative-id":["10.1145\/1583991.1584003","10.1145\/1583991"],"URL":"https:\/\/doi.org\/10.1145\/1583991.1584003","relation":{},"subject":[],"published":{"date-parts":[[2009,8,11]]},"assertion":[{"value":"2009-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}