{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T19:43:44Z","timestamp":1782589424041,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,1,9]],"date-time":"2010-01-09T00:00:00Z","timestamp":1262995200000},"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":[[2010,1,9]]},"DOI":"10.1145\/1693453.1693488","type":"proceedings-article","created":{"date-parts":[[2010,1,12]],"date-time":"2010-01-12T15:23:12Z","timestamp":1263309792000},"page":"257-268","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":118,"title":["A practical concurrent binary search tree"],"prefix":"10.1145","author":[{"given":"Nathan G.","family":"Bronson","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jared","family":"Casper","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hassan","family":"Chafi","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kunle","family":"Olukotun","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,1,9]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1259","article-title":"An algorithm for the organization of information. In Proceedings of the USSR Academy of Sciences, volume 145, pages 263--266, 1962. In Russian, English translation by Myron J","volume":"3","author":"Vel'ski\u01d0 G.","year":"1962","unstructured":"G. Adel'son-- Vel'ski\u01d0 and E. M. Landis . An algorithm for the organization of information. In Proceedings of the USSR Academy of Sciences, volume 145, pages 263--266, 1962. In Russian, English translation by Myron J . Ricci in Soviet Doklady , 3 : 1259 -- 1263 , 1962 . G. Adel'son--Vel'ski\u01d0 and E. M. Landis. An algorithm for the organization of information. In Proceedings of the USSR Academy of Sciences, volume 145, pages 263--266, 1962. In Russian, English translation by Myron J. Ricci in Soviet Doklady, 3:1259--1263, 1962.","journal-title":"Ricci in Soviet Doklady"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPDC.2009.18"},{"key":"e_1_3_2_1_3_1","volume-title":"Conflict avoidance: Data structures in transactional memory","author":"Ballard L.","year":"2006","unstructured":"L. Ballard . Conflict avoidance: Data structures in transactional memory . Brown University Undergraduate Thesis , 2006 . L. Ballard. Conflict avoidance: Data structures in transactional memory. Brown University Undergraduate Thesis, 2006."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289509"},{"key":"e_1_3_2_1_5_1","first-page":"216","volume-title":"Readings in Database Systems","author":"Bayer R.","year":"1994","unstructured":"R. Bayer and M. Schkolnick . Concurrency of operations on B-Trees . In Readings in Database Systems ( 2 nd ed.), pages 216 -- 226 , San Francisco, CA , USA, 1994 . Morgan Kaufmann Publishers Inc . R. Bayer and M. Schkolnick. Concurrency of operations on B-Trees. In Readings in Database Systems (2nd ed.), pages 216--226, San Francisco, CA, USA, 1994. Morgan Kaufmann Publishers Inc.","edition":"2"},{"key":"e_1_3_2_1_6_1","volume-title":"ResearchReport RR1998-18","author":"Bouge L.","year":"1998","unstructured":"L. Bouge , J. Gabarro , X. Messeguer , and N. Schabanel . Height-relaxed AVL rebalancing: A unified, fine-grained approach to concurrent dictionaries . ResearchReport RR1998-18 , LIP, ENS Lyon , March 1998 . L. Bouge, J. Gabarro, X. Messeguer, and N. Schabanel. Height-relaxed AVL rebalancing: A unified, fine-grained approach to concurrent dictionaries. ResearchReport RR1998-18, LIP, ENS Lyon, March 1998."},{"key":"e_1_3_2_1_7_1","unstructured":"N. Bronson. CCSTM. http:\/\/github.com\/nbronson\/ccstm.  N. Bronson. CCSTM. http:\/\/github.com\/nbronson\/ccstm."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1813164.1813180"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.3"},{"key":"e_1_3_2_1_11_1","volume-title":"OPODIS '06: Proceedings of the 10th International Conference On Principles Of Distributed Systems","author":"Herlihy M.","year":"2006","unstructured":"M. Herlihy , Y. Lev , V. Luchangco , and N. Shavit . A provably correct scalable concurrent skip list . In OPODIS '06: Proceedings of the 10th International Conference On Principles Of Distributed Systems , 2006 . M. Herlihy, Y. Lev, V. Luchangco, and N. Shavit. A provably correct scalable concurrent skip list. In OPODIS '06: Proceedings of the 10th International Conference On Principles Of Distributed Systems, 2006."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872048"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/645604.662768"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/109625.109637"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/28659.28677"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1012888.1005742"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1123001"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.12.005"}],"event":{"name":"PPoPP '10: ACM SIGPLAN Principles and Practice of Parallel Computing","location":"Bangalore India","acronym":"PPoPP '10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1693453.1693488","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1693453.1693488","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:45:35Z","timestamp":1750236335000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1693453.1693488"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,9]]},"references-count":19,"alternative-id":["10.1145\/1693453.1693488","10.1145\/1693453"],"URL":"https:\/\/doi.org\/10.1145\/1693453.1693488","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1837853.1693488","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,1,9]]},"assertion":[{"value":"2010-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}