{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:52Z","timestamp":1759638952492,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_5","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:00:50Z","timestamp":1276167650000},"page":"38-49","source":"Crossref","is-referenced-by-count":6,"title":["An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Karim","family":"Dou\u00efeb","sequence":"additional","affiliation":[]},{"given":"Vida","family":"Dujmovi\u0107","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Fagerberg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Bose, P., Dou\u00efeb, K., Dujmovi\u0107, V., Fagerberg, R.: An O(loglog n)-competitive binary search tree with optimal worst-case access times, arXiv 1003.0139 (2010)","DOI":"10.1007\/978-3-642-13731-0_5"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Demaine, E., Harmon, D., Iacono, J., Kane, D.M., Patrascu, M.: The geometry of binary search trees. In: Proc. of the 10th ACM-SIAM Symp. on Disc. Alg. (SODA), pp. 496\u2013505 (2009)","DOI":"10.1137\/1.9781611973068.55"},{"issue":"1","key":"5_CR3","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1137\/S0097539705447347","volume":"37","author":"E. Demaine","year":"2007","unstructured":"Demaine, E., Harmon, D., Iacono, J., P\u0103tra\u015fcu, M.: Dynamic optimality\u2014almost. SICOMP\u00a037(1), 240\u2013251 (2007)","journal-title":"SICOMP"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Derryberry, J., Sleator, D.D., Wang, C.C.: O(loglogn)-competitive dynamic binary search trees. In: Proc. of the 7th ACM-SIAM Symp. on Disc. Alg. (SODA), pp. 374\u2013383 (2006)","DOI":"10.1145\/1109557.1109600"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ipl.2007.10.001","volume":"106","author":"G.F. Georgakopoulos","year":"2008","unstructured":"Georgakopoulos, G.F.: Chain-splay trees, or, how to achieve and prove loglogn-competitiveness by splaying. Inf. Process. Lett.\u00a0106(1), 37\u201343 (2008)","journal-title":"Inf. Process. Lett."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: Proc. of the 19th Found. of Comp. Sci. (FOCS), pp. 8\u201321 (1978)","DOI":"10.1109\/SFCS.1978.3"},{"key":"5_CR7","unstructured":"Iacono, J.: Personal communication (July 2009)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/11940128_29","volume-title":"Algorithms and Computation","author":"J. Kujala","year":"2006","unstructured":"Kujala, J., Elomaa, T.: Poketree: A dynamically competitive data structure with good worst-case performance. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 277\u2013288. Springer, Heidelberg (2006)"},{"key":"5_CR9","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":"5_CR10","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. J. ACM\u00a032(3), 652\u2013686 (1985)","journal-title":"J. ACM"},{"key":"5_CR11","unstructured":"Wang, C.C.: Multi-Splay Trees. PhD thesis, Computer Science Department, School of Computer Science, Carnegie Mellon University (2006)"},{"issue":"1","key":"5_CR12","doi-asserted-by":"crossref","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\u00a018(1), 56\u201367 (1989)","journal-title":"SICOMP"},{"key":"5_CR13","unstructured":"Woo, S.L.: Heterogeneous Decomposition of Degree-Balanced Search Trees and Its Applications. PhD thesis, Computer Science Department, School of Computer Science, Carnegie Mellon University (2009)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:42:02Z","timestamp":1740174122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}