{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:39:00Z","timestamp":1767339540588,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"UPMARC (Uppsala Programming for Multicore Architectures Research Center)"},{"name":"Swedish Research Council"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3210377.3210413","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"121-132","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Lock-free Contention Adapting Search Trees"],"prefix":"10.1145","author":[{"given":"Kjell","family":"Winblad","sequence":"first","affiliation":[{"name":"Uppsala Univeristy, Uppsala, Sweden"}]},{"given":"Konstantinos","family":"Sagonas","sequence":"additional","affiliation":[{"name":"Uppsala Univeristy, Uppsala, Sweden"}]},{"given":"Bengt","family":"Jonsson","sequence":"additional","affiliation":[{"name":"Uppsala Univeristy, Uppsala, Sweden"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484254"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018743.3018761"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693488"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35476-2_3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25873-2_15"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3007748.3007771"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3122955.3122973"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.01.011"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/99163.99185"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2784731.2784734"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Chris Okasaki . 1999. Purely functional data structures. Cambridge Univ. Press.   Chris Okasaki . 1999. Purely functional data structures. Cambridge Univ. Press.","DOI":"10.1017\/CBO9780511530104"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2642937.2642995"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41527-2_16"},{"key":"e_1_3_2_1_15_1","unstructured":"Callum Robertson . 2014. Implementing Contention-Friendly Range Queries in Non-Blocking Key-Value Stores. Bachelor Thesis. bibinfoschoolThe University of Sydney.  Callum Robertson . 2014. Implementing Contention-Friendly Range Queries in Non-Blocking Key-Value Stores. Bachelor Thesis. bibinfoschoolThe University of Sydney."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29778-1_3"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Konstantinos Sagonas and Kjell Winblad . 2017. A contention adapting approach to concurrent ordered sets. J. Parallel and Distrib. Comput. (2017).  Konstantinos Sagonas and Kjell Winblad . 2017. A contention adapting approach to concurrent ordered sets. J. Parallel and Distrib. Comput. (2017).","DOI":"10.1016\/j.jpdc.2017.11.007"},{"key":"e_1_3_2_1_18_1","unstructured":"Konstantinos Sagonas and Kjell Winblad . 2018. Contention Adapting Search Trees. (2018). http:\/\/www.it.uu.se\/research\/group\/languages\/software\/ca_tree  Konstantinos Sagonas and Kjell Winblad . 2018. Contention Adapting Search Trees. (2018). http:\/\/www.it.uu.se\/research\/group\/languages\/software\/ca_tree"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"R. Seidel and C. R. Aragon . 1996. Randomized search trees. Algorithmica Vol. 16 4 (01 Oct. . 1996) 464--497.  R. Seidel and C. R. Aragon . 1996. Randomized search trees. Algorithmica Vol. 16 4 (01 Oct. . 1996) 464--497.","DOI":"10.1007\/BF01940876"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.43"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536232"},{"volume-title":"Faster Concurrent Range Queries with Contention Adapting Search Trees Using Immutable Data. In 2017 Imperial College Computing Student Workshop (ICCSW 2017)","year":"2017","author":"Kjell Winblad","key":"e_1_3_2_1_22_1"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Kjell Winblad Konstantinos Sagonas and Bengt Jonsson . 2018. Lock-free Contention Adapting Search Trees. (2018). Extended version of this paper available at http:\/\/www.it.uu.se\/research\/group\/languages\/software\/ca_tree  Kjell Winblad Konstantinos Sagonas and Bengt Jonsson . 2018. Lock-free Contention Adapting Search Trees. (2018). Extended version of this paper available at http:\/\/www.it.uu.se\/research\/group\/languages\/software\/ca_tree","DOI":"10.1145\/3210377.3210413"},{"key":"e_1_3_2_1_24_1","unstructured":"Yahoo! Developer Network . 2017. Flurry analytics. (2017). deftempurl%https:\/\/developer.yahoo.com\/flurry\/docs\/analytics\/ tempurl Accessed: 2017-07--26.  Yahoo! Developer Network . 2017. Flurry analytics. (2017). deftempurl%https:\/\/developer.yahoo.com\/flurry\/docs\/analytics\/ tempurl Accessed: 2017-07--26."}],"event":{"name":"SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Vienna Austria","acronym":"SPAA '18"},"container-title":["Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210413","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:20Z","timestamp":1750210760000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":24,"alternative-id":["10.1145\/3210377.3210413","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210413","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}