{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T04:06:49Z","timestamp":1768450009843,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,13]],"date-time":"2015-06-13T00:00:00Z","timestamp":1434153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Israeli Science Foundation","award":["274\/14"],"award-info":[{"award-number":["274\/14"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,13]]},"DOI":"10.1145\/2755573.2755579","type":"proceedings-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T18:43:54Z","timestamp":1434134634000},"page":"254-263","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["Efficient Memory Management for Lock-Free Data Structures with Optimistic Access"],"prefix":"10.1145","author":[{"given":"Nachshon","family":"Cohen","sequence":"first","affiliation":[{"name":"Technion Institute of Technology, Israel, Haifa, Israel"}]},{"given":"Erez","family":"Petrank","sequence":"additional","affiliation":[{"name":"Technion Institute of Technology, Israel, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2015,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592808"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1450058.1450092"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486184"},{"key":"e_1_3_2_1_4_1","unstructured":"N. Cohen and E. Petrank. Efficient memory management for lock-free data structures with optimistic access. http:\/\/www.cs.technion.ac.il\/\\~erez\/papers.html.  N. Cohen and E. Petrank. Efficient memory management for lock-free data structures with optimistic access. http:\/\/www.cs.technion.ac.il\/\\~erez\/papers.html."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/777474.777479"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40047-6_60"},{"key":"e_1_3_2_1_7_1","volume-title":"Techniques for accessing a shared resource using an improved synchronization mechanism","author":"Dice D.","year":"2010"},{"key":"e_1_3_2_1_8_1","unstructured":"K. Fraser. http:\/\/www.cl.cam.ac.uk\/research\/srg\/netos\/lock-free\/src\/temp\/lockfree-lib\/.  K. Fraser. http:\/\/www.cl.cam.ac.uk\/research\/srg\/netos\/lock-free\/src\/temp\/lockfree-lib\/."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/645958.676105"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.04.010"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062247.1062249"},{"key":"e_1_3_2_1_13_1","volume-title":"Revised Reprint","author":"Herlihy M.","year":"2012"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.139204"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/376656.376810"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564881"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03359-9_27"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247684.2247685"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1296907.1296927"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375587"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806615"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2005.451"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555261"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224988"}],"event":{"name":"SPAA '15: 27th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland Oregon USA","acronym":"SPAA '15","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2755573.2755579","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2755573.2755579","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:17:05Z","timestamp":1750227425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2755573.2755579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,13]]},"references-count":25,"alternative-id":["10.1145\/2755573.2755579","10.1145\/2755573"],"URL":"https:\/\/doi.org\/10.1145\/2755573.2755579","relation":{},"subject":[],"published":{"date-parts":[[2015,6,13]]},"assertion":[{"value":"2015-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}