{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:49:40Z","timestamp":1750308580942,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,31]],"date-time":"2017-01-31T00:00:00Z","timestamp":1485820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP1093665"],"award-info":[{"award-number":["DP1093665"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,1,31]]},"DOI":"10.1145\/3014812.3014836","type":"proceedings-article","created":{"date-parts":[[2016,12,20]],"date-time":"2016-12-20T13:25:34Z","timestamp":1482240334000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Practical adaptive search trees with performance bounds"],"prefix":"10.1145","author":[{"given":"Kevin","family":"Fray","sequence":"first","affiliation":[{"name":"The University of Melbourne"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kerri","family":"Morgan","sequence":"additional","affiliation":[{"name":"The University of Melbourne"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Wirth","sequence":"additional","affiliation":[{"name":"The University of Melbourne"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Zobel","sequence":"additional","affiliation":[{"name":"The University of Melbourne"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,1,31]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1259","article-title":"An algorithm for the organization of information","volume":"3","author":"Adelson-Velskii G.","year":"1962","unstructured":"G. Adelson-Velskii and E. Landis . An algorithm for the organization of information . Soviet Mathematics Doklady , 3 : 1259 -- 1263 , 1962 . G. Adelson-Velskii and E. Landis. An algorithm for the organization of information. Soviet Mathematics Doklady, 3:1259--1263, 1962.","journal-title":"Soviet Mathematics Doklady"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788888.1788889"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00230-7"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/322092.322094"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380230403"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208007"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.234780"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979732699X"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797326988"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447347"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03367-4_18"},{"key":"e_1_3_2_1_12_1","first-page":"903","volume-title":"ACM-SIAM Symposium on Discrete Algorithms","author":"F\u00fcrer M.","year":"1999","unstructured":"M. F\u00fcrer . Randomized splay trees . In ACM-SIAM Symposium on Discrete Algorithms , pages 903 -- 904 , 1999 . M. F\u00fcrer. Randomized splay trees. In ACM-SIAM Symposium on Discrete Algorithms, pages 903--904, 1999."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.10.001"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.3"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03367-4_31"},{"key":"e_1_3_2_1_16_1","first-page":"91","volume-title":"Proceedings of TREC-7","author":"Hawking D.","year":"1998","unstructured":"D. Hawking , N. Craswell , and P. Thistlewaite . Overview of TREC-7 very large collection track. In E. Voorhees and D. Harman, editors , Proceedings of TREC-7 , pages 91 -- 104 , 1998 . D. Hawking, N. Craswell, and P. Thistlewaite. Overview of TREC-7 very large collection track. In E. Voorhees and D. Harman, editors, Proceedings of TREC-7, pages 91--104, 1998."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/188380.188399"},{"key":"e_1_3_2_1_18_1","first-page":"516","volume-title":"ACM-SIAM Symposium on Discrete Algorithms","author":"Iacono J.","year":"2001","unstructured":"J. Iacono . Alternatives to splay trees with O(log n) worst-case access times . In ACM-SIAM Symposium on Discrete Algorithms , pages 516 -- 522 , 2001 . J. Iacono. Alternatives to splay trees with O(log n) worst-case access times. In ACM-SIAM Symposium on Discrete Algorithms, pages 516--522, 2001."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/280635"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208014"},{"key":"e_1_3_2_1_21_1","unstructured":"J. Oommen 2011. Personal communication.  J. Oommen 2011. Personal communication."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1012888.1005742"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3835"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109600"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.394"}],"event":{"name":"ACSW 2017: Australasian Computer Science Week 2017","acronym":"ACSW 2017","location":"Geelong Australia"},"container-title":["Proceedings of the Australasian Computer Science Week Multiconference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3014812.3014836","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3014812.3014836","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:05:00Z","timestamp":1750273500000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3014812.3014836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,31]]},"references-count":25,"alternative-id":["10.1145\/3014812.3014836","10.1145\/3014812"],"URL":"https:\/\/doi.org\/10.1145\/3014812.3014836","relation":{},"subject":[],"published":{"date-parts":[[2017,1,31]]},"assertion":[{"value":"2017-01-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}