{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:33:53Z","timestamp":1743028433015,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_37","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"510-522","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Splaying Preorders and Postorders"],"prefix":"10.1007","author":[{"given":"Caleb C.","family":"Levy","sequence":"first","affiliation":[]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"key":"37_CR1","first-page":"1259","volume":"3","author":"G Adel\u2019son-Vel\u2019skii","year":"1962","unstructured":"Adel\u2019son-Vel\u2019skii, G., Landis, E.: An algorithm for the organization of information. Sov. Math. Dokl. 3, 1259\u20131262 (1962)","journal-title":"Sov. Math. Dokl."},{"issue":"2","key":"37_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1018373005182","volume":"10","author":"M Akra","year":"1998","unstructured":"Akra, M., Bazzi, L.: On the solution of linear recurrence equations. Comput. Optim. Appl. 10(2), 195\u2013210 (1998)","journal-title":"Comput. Optim. Appl."},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Goswami, M., Kozma, L., Mehlhorn, K., Saranurak, T.: Pattern-avoiding access in binary search trees. In: FOCS, pp. 410\u2013423 (2015)","DOI":"10.1109\/FOCS.2015.32"},{"issue":"2","key":"37_CR4","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1145\/156063.156067","volume":"24","author":"R Chaudhuri","year":"1993","unstructured":"Chaudhuri, R., H\u00f6ft, H.: Splaying a search tree in preorder takes linear time. ACM SIGACT News 24(2), 88\u201393 (1993)","journal-title":"ACM SIGACT News"},{"issue":"1","key":"37_CR5","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1137\/S009753979732699X","volume":"30","author":"R Cole","year":"2000","unstructured":"Cole, R.: On the dynamic finger conjecture for splay trees. Part II: the proof. SICOMP 30(1), 44\u201385 (2000)","journal-title":"SICOMP"},{"issue":"1","key":"37_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539797326988","volume":"30","author":"R Cole","year":"2000","unstructured":"Cole, R., Mishra, B., Schmidt, J., Siegel, A.: On the dynamic finger conjecture for splay trees. Part I: splay sorting $$\\log n$$-block sequences. SICOMP 30(1), 1\u201343 (2000)","journal-title":"SICOMP"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Demaine, E., Harmon, D., Iacono, J., Kane, D., P\u01cetra\u015fcu, M.: The geometry of binary search trees. In: SODA, pp. 496\u2013505 (2009)","DOI":"10.1137\/1.9781611973068.55"},{"key":"37_CR8","first-page":"411","volume-title":"Lecture Notes in Computer Science","author":"Kyle Fox","year":"2011","unstructured":"Fox, K.: Upper bounds for maximally greedy binary search trees. In: WADS, pp. 411\u2013422 (2011)"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.tcs.2018.12.021","volume":"776","author":"N Goyal","year":"2019","unstructured":"Goyal, N., Gupta, M.: Better analysis of binary search tree on decomposable sequences. Theor. Comput. Sci. 776, 19\u201324 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Guibas, L., Sedgewick, R.: A dichromatic framework for balanced trees. In: FOCS, pp. 8\u201321 (1978)","DOI":"10.1109\/SFCS.1978.3"},{"issue":"4","key":"37_CR11","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/2689412","volume":"11","author":"B Haeupler","year":"2015","unstructured":"Haeupler, B., Sen, S., Tarjan, R.: Rank-balanced trees. TALG 11(4), 30 (2015)","journal-title":"TALG"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Iacono, J., Langerman, S.: Weighted dynamic finger in binary search trees. In: SODA, pp. 672\u2013691 (2016)","DOI":"10.1137\/1.9781611974331.ch49"},{"key":"37_CR13","unstructured":"Kozma, L.: Binary search trees, rectangles and patterns. Ph.D. thesis, Saarland University (2016)"},{"key":"37_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.tcs.2007.12.015","volume":"393","author":"J Kujala","year":"2008","unstructured":"Kujala, J., Elomaa, T.: The cost of offline binary search tree algorithms and the complexity of the request sequence. TCS 393, 231\u2013239 (2008)","journal-title":"TCS"},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1137\/1.9781611975482.80","volume-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Caleb Levy","year":"2019","unstructured":"Levy, C., Tarjan, R.: A new path from splay to dynamic optimality. In: SODA, pp. 1311\u20131330 (2019)"},{"key":"37_CR16","unstructured":"Lucas, J.: Canonical forms for competitive binary search tree algorithms. Technical report, Rutgers University (1988)"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Munro, I.: On the competitiveness of linear search. In: ESA, pp. 338\u2013345 (2000)","DOI":"10.1007\/3-540-45253-2_31"},{"issue":"1","key":"37_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0202005","volume":"2","author":"J Nievergelt","year":"1973","unstructured":"Nievergelt, J., Reingold, E.: Binary search trees of bounded balance. SICOMP 2(1), 33\u201343 (1973)","journal-title":"SICOMP"},{"key":"37_CR19","unstructured":"Pettie, S.: Splay trees, davenport-schinzel sequences, and the deque conjecture. In: SODA, pp. 1115\u20131124 (2008)"},{"key":"37_CR20","doi-asserted-by":"crossref","unstructured":"Pettie, S.: Applications of forbidden 0\u20131 matrices to search tree and path compression-based data structures. In: SODA, pp. 1457\u20131467 (2010)","DOI":"10.1137\/1.9781611973075.118"},{"issue":"3","key":"37_CR21","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.: Self-adjusting binary search trees. J. ACM 32(3), 652\u2013686 (1985)","journal-title":"J. ACM"},{"issue":"1","key":"37_CR22","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01191208","volume":"12","author":"R Sundar","year":"1992","unstructured":"Sundar, R.: On the deque conjecture for the splay algorithm. Combinatorica 12(1), 95\u2013124 (1992)","journal-title":"Combinatorica"},{"issue":"2","key":"37_CR23","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R Tarjan","year":"1985","unstructured":"Tarjan, R.: Amortized computational complexity. SIAM J. Algebraic Discrete Meth. 6(2), 306\u2013318 (1985)","journal-title":"SIAM J. Algebraic Discrete Meth."},{"issue":"4","key":"37_CR24","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF02579253","volume":"5","author":"R Tarjan","year":"1985","unstructured":"Tarjan, R.: Sequential access in splay trees takes linear time. Combinatorica 5(4), 367\u2013378 (1985)","journal-title":"Combinatorica"},{"issue":"1","key":"37_CR25","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0218004","volume":"18","author":"R Wilber","year":"1989","unstructured":"Wilber, R.: Lower bounds for accessing binary search trees with rotations. SICOMP 18(1), 56\u201367 (1989)","journal-title":"SICOMP"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:55:38Z","timestamp":1710266138000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}