{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:41Z","timestamp":1772164061398,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,8,29]],"date-time":"2015-08-29T00:00:00Z","timestamp":1440806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1218375 and CCF-1453508"],"award-info":[{"award-number":["CCF-1218375 and CCF-1453508"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,8,29]]},"DOI":"10.1145\/2784731.2784734","type":"proceedings-article","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T12:48:13Z","timestamp":1440593293000},"page":"218-229","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Adaptive lock-free maps: purely-functional to scalable"],"prefix":"10.1145","author":[{"given":"Ryan R.","family":"Newton","sequence":"first","affiliation":[{"name":"Indiana University, USA"}]},{"given":"Peter P.","family":"Fogg","sequence":"additional","affiliation":[{"name":"Indiana University, USA"}]},{"given":"Ali","family":"Varamesh","sequence":"additional","affiliation":[{"name":"Indiana University, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,8,29]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Functional pearls efficient setsa balancing act. Journal of functional programming, 3(04):553\u2013561","author":"Adams S.","year":"1993","unstructured":"S. Adams . Functional pearls efficient setsa balancing act. Journal of functional programming, 3(04):553\u2013561 , 1993 . S. Adams. Functional pearls efficient setsa balancing act. Journal of functional programming, 3(04):553\u2013561, 1993."},{"key":"e_1_3_2_1_2_1","unstructured":"S. Bauman C. F. Bolz R. Hirschfeld V. Krilichev T. Pape J. Siek and S. Tobin-Hochstadt. Pycket: A tracing jit for a functional language.  S. Bauman C. F. Bolz R. Hirschfeld V. Krilichev T. Pape J. Siek and S. Tobin-Hochstadt. Pycket: A tracing jit for a functional language."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2544173.2509531"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807221"},{"key":"e_1_3_2_1_5_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. Stein , R. L. Rivest , and C. E. Leiserson . Introduction to Algorithms . McGraw-Hill Higher Education , 2 nd edition, 2001 . ISBN 0070131511. T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson. Introduction to Algorithms. McGraw-Hill Higher Education, 2nd edition, 2001. ISBN 0070131511.","edition":"2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007175"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":". URL http:\/\/dx.doi.org\/10.1017\/S0956796809007175.    10.1017\/S0956796809007175\n. URL http:\/\/dx.doi.org\/10.1017\/S0956796809007175.","DOI":"10.1017\/S0956796809007175"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282480.1282513"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007944"},{"key":"e_1_3_2_1_11_1","volume-title":"Conference On Principles of Distributed Systems (OPODIS). Citeseer","author":"Herlihy M.","year":"2006","unstructured":"M. Herlihy , Y. Lev , V. Luchangco , and N. Shavit . A provably correct scalable concurrent skip list . In Conference On Principles of Distributed Systems (OPODIS). Citeseer , 2006 . M. Herlihy, Y. Lev, V. Luchangco, and N. Shavit. A provably correct scalable concurrent skip list. In Conference On Principles of Distributed Systems (OPODIS). Citeseer, 2006."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_13_1","volume-title":"Crdts: Consistency without concurrency control. CoRR, abs\/0907.0929","author":"Letia M.","year":"2009","unstructured":"M. Letia , N. M. Preguic\u00b8a , and M. Shapiro . Crdts: Consistency without concurrency control. CoRR, abs\/0907.0929 , 2009 . URL http:\/\/ arxiv.org\/abs\/0907.0929. M. Letia, N. M. Preguic\u00b8a, and M. Shapiro. Crdts: Consistency without concurrency control. CoRR, abs\/0907.0929, 2009. URL http:\/\/ arxiv.org\/abs\/0907.0929."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796806005995"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2076022.1993482"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1631687.1596563"},{"key":"e_1_3_2_1_17_1","unstructured":". URL http:\/\/doi.acm.org\/10.1145\/1631687.  . URL http:\/\/doi.acm.org\/10.1145\/1631687."},{"key":"e_1_3_2_1_18_1","unstructured":"1596563.  1596563."},{"key":"e_1_3_2_1_19_1","series-title":"SIAM journal on Computing, 2(1):33\u201343","volume-title":"Binary search trees of bounded balance","author":"Nievergelt J.","year":"1973","unstructured":"J. Nievergelt and E. M. Reingold . Binary search trees of bounded balance . SIAM journal on Computing, 2(1):33\u201343 , 1973 . J. Nievergelt and E. M. Reingold. Binary search trees of bounded balance. SIAM journal on Computing, 2(1):33\u201343, 1973."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237794"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147958"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1897852.1897873"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/215399.215419"},{"key":"e_1_3_2_1_24_1","unstructured":"215419.  215419."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989550"},{"key":"e_1_3_2_1_26_1","unstructured":"1989550.  1989550."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1813164.1813186"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39038-8_1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1952682.1952688"}],"event":{"name":"ICFP'15: 20th ACM SIGPLAN International Conference on Functional Programming","location":"Vancouver BC Canada","acronym":"ICFP'15","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2784731.2784734","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2784731.2784734","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:16:48Z","timestamp":1750213008000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2784731.2784734"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,29]]},"references-count":28,"alternative-id":["10.1145\/2784731.2784734","10.1145\/2784731"],"URL":"https:\/\/doi.org\/10.1145\/2784731.2784734","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2858949.2784734","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015,8,29]]},"assertion":[{"value":"2015-08-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}