{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:58Z","timestamp":1750306078656,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T00:00:00Z","timestamp":1500940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF CCF","award":["1421126","003991"],"award-info":[{"award-number":["1421126","003991"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,25]]},"DOI":"10.1145\/3087801.3087866","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"251-253","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Brief Announcement"],"prefix":"10.1145","author":[{"given":"Thomas","family":"Dickerson","sequence":"first","affiliation":[{"name":"Brown University, Providence, RI, USA"}]},{"given":"Paul","family":"Gazzillo","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[{"name":"Brown University, Providence, RI, USA"}]},{"given":"Eric","family":"Koskinen","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/1229428.1229484"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/1835698.1835703"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1693453.1693464"},{"key":"e_1_3_2_1_4_1","volume-title":"Fast snapshottable concurrent braun heaps. arXiv preprint arXiv:1705.06271","author":"Dickerson T. D.","year":"2017","unstructured":"T. D. Dickerson . Fast snapshottable concurrent braun heaps. arXiv preprint arXiv:1705.06271 , 2017 . T. D. Dickerson. Fast snapshottable concurrent braun heaps. arXiv preprint arXiv:1705.06271, 2017."},{"key":"e_1_3_2_1_5_1","volume-title":"Proust: A design space for highly-concurrent transactional data structures. arXiv preprint arXiv:1702.04866","author":"Dickerson T. D.","year":"2017","unstructured":"T. D. Dickerson , P. Gazzillo , E. Koskinen , and M. Herlihy . Proust: A design space for highly-concurrent transactional data structures. arXiv preprint arXiv:1702.04866 , 2017 . T. D. Dickerson, P. Gazzillo, E. Koskinen, and M. Herlihy. Proust: A design space for highly-concurrent transactional data structures. arXiv preprint arXiv:1702.04866, 2017."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/1542476.1542494"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1016\/j.jpdc.2012.09.015"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/1772954.1772970"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/1345206.1345233"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/1378704.1378725"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/2555243.2555283"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/1345206.1345237"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/872035.872048"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/2901318.2901348"},{"unstructured":"Intel Corporation. Intel C  Intel Corporation. Intel C","key":"e_1_3_2_1_15_1"},{"unstructured":"STM\n      Compiler Prototype\n      Edition\n    . Web.\n   Retrieved from http:\/\/software.intel.com\/en-us\/articles\/intel-c-stm-compiler-prototype-edition\/ 20 \n  November\n  2011\n  .  STM Compiler Prototype Edition. Web. Retrieved from http:\/\/software.intel.com\/en-us\/articles\/intel-c-stm-compiler-prototype-edition\/ 20 November 2011.","key":"e_1_3_2_1_16_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/1345206.1345240"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/1248377.1248415"},{"key":"e_1_3_2_1_19_1","volume-title":"Deuce stm - java software transactional memory. web.","author":"The Deuce STM Group","year":"2011","unstructured":"The Deuce STM Group . Deuce stm - java software transactional memory. web. Retrieved from http:\/\/www.deucestm.org\/documentation, 20 November 2011 . The Deuce STM Group. Deuce stm - java software transactional memory. web. Retrieved from http:\/\/www.deucestm.org\/documentation, 20 November 2011."}],"event":{"sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"PODC '17","name":"PODC '17: ACM Symposium on Principles of Distributed Computing","location":"Washington DC USA"},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087866","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087801.3087866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:07Z","timestamp":1750217407000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087866"}},"subtitle":["Proust: A Design Space for Highly-Concurrent Transactional Data Structures"],"short-title":[],"issued":{"date-parts":[[2017,7,25]]},"references-count":19,"alternative-id":["10.1145\/3087801.3087866","10.1145\/3087801"],"URL":"https:\/\/doi.org\/10.1145\/3087801.3087866","relation":{},"subject":[],"published":{"date-parts":[[2017,7,25]]},"assertion":[{"value":"2017-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}