{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:26Z","timestamp":1725536006308},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033667"},{"type":"electronic","value":"9783642033674"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03367-4_18","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T07:56:42Z","timestamp":1248076602000},"page":"194-205","source":"Crossref","is-referenced-by-count":7,"title":["Skip-Splay: Toward Achieving the Unified Bound in the BST Model"],"prefix":"10.1007","author":[{"given":"Jonathan C.","family":"Derryberry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel D.","family":"Sleator","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","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 ACM\u00a032, 652\u2013686 (1985)","journal-title":"Journal of the ACM"},{"issue":"1","key":"18_CR2","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 Journal on Computing\u00a018(1), 56\u201367 (1989)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"18_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.P., Siegel, A.: On the dynamic finger conjecture for splay trees, part I: Splay sorting log n-block sequences. SIAM Journal on Computing\u00a030(1), 1\u201343 (2000)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"18_CR4","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 Journal on Computing\u00a030(1), 44\u201385 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR5","unstructured":"Iacono, J.: Alternatives to splay trees with o(log n) worst-case access times. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 516\u2013522. Society for Industrial and Applied Mathematics (2001)"},{"issue":"2","key":"18_CR6","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2007.03.002","volume":"382","author":"M. B\u0103doiu","year":"2007","unstructured":"B\u0103doiu, M., Cole, R., Demaine, E.D., Iacono, J.: A unified access bound on comparison-based dynamic dictionaries. Theoretical Computer Science\u00a0382(2), 86\u201396 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"18_CR7","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\u01cetra\u015fcu, M.: Dynamic optimality\u2014almost. SIAM Journal on Computing\u00a037(1), 240\u2013251 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR8","first-page":"374","volume-title":"Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms","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: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 374\u2013383. ACM, New York (2006)"},{"issue":"1","key":"18_CR9","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. Information Processing Letters\u00a0106(1), 37\u201343 (2008)","journal-title":"Information Processing Letters"}],"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-03367-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T06:14:27Z","timestamp":1552112067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}