{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T17:26:24Z","timestamp":1676654784288},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,6,21]],"date-time":"2011-06-21T00:00:00Z","timestamp":1308614400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s00453-011-9542-1","type":"journal-article","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T14:49:06Z","timestamp":1308581346000},"page":"476-489","source":"Crossref","is-referenced-by-count":3,"title":["Layered Working-Set Trees"],"prefix":"10.1007","volume":"63","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":"John","family":"Howat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,21]]},"reference":[{"issue":"2","key":"9542_CR1","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 382(2), 86\u201396 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9542_CR2","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/BF00289509","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R.: Symmetric binary B-trees: Data structures and maintenance algorithms. Acta Inform. 1, 290\u2013306 (1972)","journal-title":"Acta Inform."},{"issue":"1","key":"9542_CR3","doi-asserted-by":"crossref","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. 30(1), 44\u201385 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9542_CR4","doi-asserted-by":"crossref","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\u2009n-block sequences. SIAM J. Comput. 30(1), 1\u201343 (2000)","journal-title":"SIAM J. Comput."},{"key":"9542_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"9542_CR6","volume-title":"WADS \u201909: Proceedings of the 16th Annual International Workshop on Algorithms and Data Structures","author":"J.C. Derryberry","year":"2009","unstructured":"Derryberry, J.C., Sleator, D.D.: Skip-splay: Toward achieving the unified bound in the BST model. In: WADS \u201909: Proceedings of the 16th Annual International Workshop on Algorithms and Data Structures (2009)"},{"key":"9542_CR7","first-page":"8","volume-title":"FOCS \u201978: Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science","author":"L.J. Guibas","year":"1978","unstructured":"Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: FOCS \u201978: Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, pp. 8\u201321 (1978)"},{"issue":"3","key":"9542_CR8","doi-asserted-by":"crossref","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 32(3), 652\u2013686 (1985)","journal-title":"J. ACM"},{"key":"9542_CR9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"Tarjan, R.E.: Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia (1983)"},{"issue":"1","key":"9542_CR10","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. SIAM J. Comput. 18(1), 56\u201367 (1989)","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9542-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9542-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9542-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:07Z","timestamp":1559137507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9542-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,21]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9542"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9542-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,21]]}}}