{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:59Z","timestamp":1750306079107,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,25]]},"DOI":"10.1145\/3087801.3087838","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"231-240","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Transactional Lock Elision Meets Combining"],"prefix":"10.1145","author":[{"given":"Alex","family":"Kogan","sequence":"first","affiliation":[{"name":"Oracle Labs, Burlington, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yossi","family":"Lev","sequence":"additional","affiliation":[{"name":"Oracle Labs, Burlington, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611482"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935796"},{"volume-title":"Combining Techniques Application for Tree Search Structures. Master's thesis","author":"Budovsky Vladimir","key":"e_1_3_2_1_3_1","unstructured":"Vladimir Budovsky . 2010. Combining Techniques Application for Tree Search Structures. Master's thesis . Tel Aviv University . Vladimir Budovsky. 2010. Combining Techniques Application for Tree Search Structures. Master's thesis. Tel Aviv University."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612696"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508263"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755578"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2628071.2628080"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14472-6_24"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145849"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the Int. Conference on Principles of Distributed Systems (OPODIS). 3--16","author":"Heller Steve","year":"2005","unstructured":"Steve Heller , Maurice Herlihy , Victor Luchangco , Mark Moir , William N. Scherer , and Nir Shavit . 2005 . A Lazy Concurrent List-based Set Algorithm . In Proceedings of the Int. Conference on Principles of Distributed Systems (OPODIS). 3--16 . Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer, and Nir Shavit. 2005. A Lazy Concurrent List-based Set Algorithm. In Proceedings of the Int. Conference on Principles of Distributed Systems (OPODIS). 3--16."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810540"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15763-9_8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750403"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2001.991127"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503232"}],"event":{"name":"PODC '17: 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":"Washington DC USA","acronym":"PODC '17"},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087838","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087801.3087838","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.3087838"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,25]]},"references-count":15,"alternative-id":["10.1145\/3087801.3087838","10.1145\/3087801"],"URL":"https:\/\/doi.org\/10.1145\/3087801.3087838","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"}}]}}