{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:14Z","timestamp":1750306334677,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,25]],"date-time":"2016-07-25T00:00:00Z","timestamp":1469404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,25]]},"DOI":"10.1145\/2933057.2933115","type":"proceedings-article","created":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T20:07:42Z","timestamp":1469563662000},"page":"335-344","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Are Shared Objects Composable under an Oblivious Adversary?"],"prefix":"10.1145","author":[{"given":"Oksana","family":"Denysyuk","sequence":"first","affiliation":[{"name":"University of Calgary, Calgary, AB, Canada"}]},{"given":"Philipp","family":"Woelfel","sequence":"additional","affiliation":[{"name":"University of Calgary, Calgary, AB, Canada"}]}],"member":"320","published-online":{"date-parts":[[2016,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.84"},{"key":"e_1_3_2_1_2_1","first-page":"60","volume-title":"Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability","author":"Denysyuk Oksana","year":"2015","unstructured":"Oksana Denysyuk and Philipp Woelfel . Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability , pages 60 -- 74 . 2015 . Oksana Denysyuk and Philipp Woelfel. Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability, pages 60--74. 2015."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993687"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332508"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_6_1","first-page":"522","volume-title":"International Conference on Distributed Computing Systems (ICDCS)","author":"Herlihy Maurice","year":"2003","unstructured":"Maurice Herlihy , Victor Luchangco , and Mark Moir . Obstruction-free synchronization : Double-ended queues as an example . In International Conference on Distributed Computing Systems (ICDCS) , pages 522 -- 529 , May 2003 . Maurice Herlihy, Victor Luchangco, and Mark Moir. Obstruction-free synchronization: Double-ended queues as an example. In International Conference on Distributed Computing Systems (ICDCS), pages 522--529, May 2003."},{"key":"e_1_3_2_1_7_1","volume-title":"Distributed Algorithms","author":"Lynch Nancy A.","year":"1996","unstructured":"Nancy A. Lynch . Distributed Algorithms . Morgan Kaufmann Publishers Inc ., 1996 . Nancy A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers Inc., 1996."}],"event":{"name":"PODC '16: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago Illinois USA","acronym":"PODC '16"},"container-title":["Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933115","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933057.2933115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:51Z","timestamp":1750222491000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,25]]},"references-count":7,"alternative-id":["10.1145\/2933057.2933115","10.1145\/2933057"],"URL":"https:\/\/doi.org\/10.1145\/2933057.2933115","relation":{},"subject":[],"published":{"date-parts":[[2016,7,25]]},"assertion":[{"value":"2016-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}