{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:02:54Z","timestamp":1725897774221},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315930"},{"type":"electronic","value":"9783642315947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31594-7_11","type":"book-chapter","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T17:20:21Z","timestamp":1340385621000},"page":"121-132","source":"Crossref","is-referenced-by-count":2,"title":["De-amortizing Binary Search Trees"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Collette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Fagerberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","first-page":"1259","volume":"3","author":"G.M. Adel\u2019son-Vel\u2019skii","year":"1962","unstructured":"Adel\u2019son-Vel\u2019skii, G.M., Landis, E.M.: An algorithm for the organization of information. Soviet. Math.\u00a03, 1259\u20131262 (1962)","journal-title":"Soviet. Math."},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/322092.322094","volume":"25","author":"B. Allen","year":"1978","unstructured":"Allen, B., Munro, I.: Self-organizing binary search trees. JACM\u00a025(4), 526\u2013535 (1978)","journal-title":"JACM"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2007.03.002","volume":"382","author":"M. Badoiu","year":"2007","unstructured":"Badoiu, M., Cole, R., Demaine, E.D., Iacono, J.: A unified access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci.\u00a0382(2), 86\u201396 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR4","unstructured":"Bose, P., Dou\u00efeb, K., Langerman, S.: Dynamic optimality for skip lists and B-trees. In: Proc. of the ACM-SIAM Symposium On Discrete Algorithms, pp. 1106\u20131114 (2008)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-17517-6_12","volume-title":"Algorithms and Computation","author":"P. Bose","year":"2010","unstructured":"Bose, P., Dou\u00efeb, K.: Should Static Search Trees Ever Be Unbalanced? In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol.\u00a06506, pp. 109\u2013120. Springer, Heidelberg (2010)"},{"key":"11_CR6","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(log log n)-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":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/978-3-642-12200-2_59","volume-title":"LATIN 2010: Theoretical Informatics","author":"P. Bose","year":"2010","unstructured":"Bose, P., Dou\u00efeb, K., Dujmovi\u0107, V., Howat, J.: Layered Working-Set Trees. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 686\u2013696. Springer, Heidelberg (2010)"},{"issue":"1","key":"11_CR8","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. Computing\u00a030(1), 44\u201385 (2000)","journal-title":"SIAM J. Computing"},{"issue":"1","key":"11_CR9","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. SIAM J. Computing\u00a030(1), 1\u201343 (2000)","journal-title":"SIAM J. Computing"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Harmon, D., Iacono, J., Kane, D., P\u01cetra\u015fcu, M.: The geometry of binary search trees. In: Proc. of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, New York, January 4-6, pp. 496\u2013505 (2009)","DOI":"10.1137\/1.9781611973068.55"},{"issue":"1","key":"11_CR11","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., Patrascu, M.: Dynamic optimality - almost. SIAM J. Comput.\u00a037(1), 240\u2013251 (2007)","journal-title":"SIAM J. Comput."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-03367-4_18","volume-title":"Algorithms and Data Structures","author":"J. Derryberry","year":"2009","unstructured":"Derryberry, J., Sleator, D.D.: Skip-Splay: Toward Achieving the Unified Bound in the BST Model. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 194\u2013205. Springer, Heidelberg (2009)"},{"key":"11_CR13","unstructured":"Derryberry, J., Sleator, D.D., Wang, C.C.: A lower bound framework for binary search trees with rotations. Technical Report CMU-CS-05-187. Carnegie Mellon University (November 2005)"},{"key":"11_CR14","unstructured":"Derryberry, J., Sleator, D.D., Wang, C.C.: Properties of multi-splay trees. Technical Report CMU-CS-09-180. Carnegie Mellon University (November 2009)"},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.jalgor.2003.09.004","volume":"51","author":"G.F. Georgakopoulos","year":"2004","unstructured":"Georgakopoulos, G.F.: Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees. Journal of Algorithms\u00a051(1), 64\u201376 (2004)","journal-title":"Journal of Algorithms"},{"key":"11_CR16","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, 37\u201343 (2008)","journal-title":"Inf. Process. Lett."},{"key":"11_CR17","unstructured":"Gold Effie Award, \n                    \n                      http:\/\/www.effie.org\/winners\/showcase\/2006\/256"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Sedgewick, R.: A dichomatic framework for balanced trees. In: Proc. 19th Ann. IEEE Symp. on Theory of Computing, pp. 8\u201321 (1978)","DOI":"10.1109\/SFCS.1978.3"},{"key":"11_CR19","unstructured":"Iacono, J.: Alternatives to splay trees with O(logn) worst-case access times. In: Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, pp. 516\u2013522 (2001)"},{"issue":"1","key":"11_CR20","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(1), 3\u201310 (2005)","journal-title":"Algorithmica"},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00453-004-1139-5","volume":"42","author":"J. Iacono","year":"2005","unstructured":"Iacono, J., Langerman, S.: Queaps. Algorithmica\u00a042(1), 49\u201356 (2005)","journal-title":"Algorithmica"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"D.E. Knuth","year":"1971","unstructured":"Knuth, D.E.: Optimum binary search trees. Acta Inf.\u00a01, 14\u201325 (1971)","journal-title":"Acta Inf."},{"key":"11_CR23","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 trees. JACM\u00a032, 652\u2013686 (1985)","journal-title":"JACM"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/1109557.1109600","volume-title":"Proc. of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm","author":"C.C. Wang","year":"2006","unstructured":"Wang, C.C., Derryberry, J., Sleator, D.D.: O(log log n)-competitive dynamic binary search trees. In: Proc. of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 374\u2013383. ACM, New York (2006)"},{"issue":"1","key":"11_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. SIAM J. Computing\u00a018(1), 56\u201367 (1989)","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31594-7_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:14:48Z","timestamp":1620116088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31594-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315930","9783642315947"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31594-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}