{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:38Z","timestamp":1759638938990},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222993"},{"type":"electronic","value":"9783642223006"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22300-6_35","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:41:31Z","timestamp":1312893691000},"page":"411-422","source":"Crossref","is-referenced-by-count":4,"title":["Upper Bounds for Maximally Greedy Binary Search Trees"],"prefix":"10.1007","author":[{"given":"Kyle","family":"Fox","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-13731-0_5","volume-title":"Algorithm Theory - SWAT 2010","author":"P. Bose","year":"2010","unstructured":"Bose, P., Dou\u00efeb, K., Dujmovi\u0107, V., Fagerberg, R.: An O(loglogn)-competitive binary search tree with optimal worst-case access times. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol.\u00a06139, pp. 38\u201349. Springer, Heidelberg (2010)"},{"key":"35_CR2","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. SIAM J. Comput.\u00a030, 44\u201385 (2000)","journal-title":"SIAM J. Comput."},{"key":"35_CR3","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 logn-block sequences. SIAM J. Comput.\u00a030, 1\u201343 (2000)","journal-title":"SIAM J. Comput."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Harmon, D., Iacono, J., Kane, D., P\u0103tra\u015fcu, M.: The geometry of binary search trees. In: Proc. 20th ACM\/SIAM Symposium on Discrete Algorithms, pp. 496\u2013505 (2009)","DOI":"10.1137\/1.9781611973068.55"},{"issue":"1","key":"35_CR5","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1137\/S0097539705447347","volume":"37","author":"E.D. Demaine","year":"2007","unstructured":"Demaine, E.D., Harmon, D., Iacono, J., P\u0103tra\u015fcu, M.: Dynamic optimality\u2013almost. SIAM J. Comput.\u00a037(1), 240\u2013251 (2007)","journal-title":"SIAM J. Comput."},{"key":"35_CR6","unstructured":"Derryberry, J., Sleator, D.D., Wang, C.C.: A lower bound framework for binary search trees with rotations. Tech. Rep. CMU-CS-05-187. Carnegie Mellon University (2005)"},{"issue":"3","key":"35_CR7","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/j.tcs.2004.01.019","volume":"314","author":"A. Elmasry","year":"2004","unstructured":"Elmasry, A.: On the sequential access theorem and deque conjecture for splay trees. Theoretical Computer Science\u00a0314(3), 459\u2013466 (2004)","journal-title":"Theoretical Computer Science"},{"key":"35_CR8","unstructured":"Goyal, N., Gupta, M.: On dynamic optimality for binary search trees (2011), http:\/\/arxiv.org\/abs\/1102.4523"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-004-1136-8","volume":"42","author":"J. Iacono","year":"2005","unstructured":"Iacono, J.: Key independent optimality. Algorithmica\u00a042, 3\u201310 (2005)","journal-title":"Algorithmica"},{"key":"35_CR10","unstructured":"Lucas, J.M.: Canonical forms for competitive binary search tree algorithms. Tech. Rep. DCS-TR-250. Rutgers University (1988)"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/3-540-45253-2_31","volume-title":"Algorithms - ESA 2000","author":"J.I. Munro","year":"2000","unstructured":"Munro, J.I.: On the competitiveness of linear search. In: Paterson, M. (ed.) ESA 2000. LNCS, vol.\u00a01879, pp. 338\u2013345. Springer, Heidelberg (2000)"},{"issue":"3","key":"35_CR12","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. Journal of the Association for Computing Machinery\u00a032(3), 652\u2013686 (1985)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF02579253","volume":"5","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Sequential access in splay trees takes linear time. Combinatorica\u00a05, 367\u2013378 (1985)","journal-title":"Combinatorica"},{"key":"35_CR14","unstructured":"Wang, C.C.: Multi-Splay Trees. Ph.D. thesis. Carnegie Mellon University (2006)"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Wang, C.C., Derryberry, J., Sleator, D.D.: O(loglogn)-competitive binary search trees. In: Proc. 17th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 374\u2013383 (2006)","DOI":"10.1145\/1109557.1109600"},{"issue":"1","key":"35_CR16","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0218004","volume":"18","author":"R.E. Wilber","year":"1989","unstructured":"Wilber, R.E.: Lower bounds for accessing binary search trees with rotations. SIAM J. Comput.\u00a018(1), 56\u201367 (1989)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22300-6_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T22:54:05Z","timestamp":1560466445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22300-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222993","9783642223006"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22300-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}