{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:16Z","timestamp":1772164036221,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T00:00:00Z","timestamp":1330128000000},"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":[[2012,2,25]]},"DOI":"10.1145\/2145816.2145837","type":"proceedings-article","created":{"date-parts":[[2012,2,28]],"date-time":"2012-02-28T07:58:45Z","timestamp":1330415925000},"page":"161-170","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["A speculation-friendly binary search tree"],"prefix":"10.1145","author":[{"given":"Tyler","family":"Crain","sequence":"first","affiliation":[{"name":"IRISA, Rennes, France"}]},{"given":"Vincent","family":"Gramoli","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[{"name":"IRISA, Rennes, France"}]}],"member":"320","published-online":{"date-parts":[[2012,2,25]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"263","volume-title":"Proc. of the USSR Academy of Sciences","volume":"146","author":"Adelson-Velskii G.","year":"1962","unstructured":"G. Adelson-Velskii and E. M. Landis . An algorithm for the organization of information . In Proc. of the USSR Academy of Sciences , volume 146 , pages 263 -- 266 , 1962 . G. Adelson-Velskii and E. M. Landis. An algorithm for the organization of information. In Proc. of the USSR Academy of Sciences, volume 146, pages 263--266, 1962."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504200"},{"key":"e_1_3_2_1_3_1","volume-title":"May","author":"Ballard L.","year":"2006","unstructured":"L. Ballard . Conflict avoidance: Data structures in transactional memory , May 2006 . Undergraduate thesis, Brown University . L. Ballard. Conflict avoidance: Data structures in transactional memory, May 2006. Undergraduate thesis, Brown University."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289509"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693488"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. of The IEEE Int'l Symp. on Workload Characterization","author":"Minh C. Cao","year":"2008","unstructured":"C. Cao Minh , J. Chung , C. Kozyrakis , and K. Olukotun . STAMP: Stanford transactional applications for multi-processing . In Proc. of The IEEE Int'l Symp. on Workload Characterization , 2008 . C. Cao Minh, J. Chung, C. Kozyrakis, and K. Olukotun. STAMP: Stanford transactional applications for multi-processing. In Proc. of The IEEE Int'l Symp. on Workload Characterization, 2008."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.03.006"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693464"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_14"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/359642.359655"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1924421.1924440"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345241"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1813164.1813180"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25821-3_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065952"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345237"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872048"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_3_2_1_22_1","volume-title":"May","author":"Intel Corporation","year":"2009","unstructured":"Intel Corporation . Intel transactional memory compiler and runtime application binary interface , May 2009 . Intel Corporation. Intel transactional memory compiler and runtime application binary interface, May 2009."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/182.358442"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1270.318576"},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. of the 16th Int'l Conference on Very Large Data Bases","author":"Mohan C.","year":"1990","unstructured":"C. Mohan . Commit-LSN : a novel and simple method for reducing locking and latching in transaction processing systems . In Proc. of the 16th Int'l Conference on Very Large Data Bases , 1990 . C. Mohan. Commit-LSN: a novel and simple method for reducing locking and latching in transaction processing systems. In Proc. of the 16th Int'l Conference on Very Large Data Bases, 1990."},{"key":"e_1_3_2_1_26_1","volume-title":"Workshop on Memory Performance Issues","author":"Moss J. E. B.","year":"2006","unstructured":"J. E. B. Moss . Open nested transactions: Semantics and support . In Workshop on Memory Performance Issues , 2006 . J. E. B. Moss. Open nested transactions: Semantics and support. In Workshop on Memory Performance Issues, 2006."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229428.1229442"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/113413.113430"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/28659.28677"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989500"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693462"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1897852.1897873"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224987"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378582"}],"event":{"name":"PPoPP '12: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"New Orleans Louisiana USA","acronym":"PPoPP '12","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2145816.2145837","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2145816.2145837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:54:52Z","timestamp":1750226092000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2145816.2145837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,25]]},"references-count":32,"alternative-id":["10.1145\/2145816.2145837","10.1145\/2145816"],"URL":"https:\/\/doi.org\/10.1145\/2145816.2145837","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2370036.2145837","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2012,2,25]]},"assertion":[{"value":"2012-02-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}