{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:25:42Z","timestamp":1740029142453,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_59","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T13:53:05Z","timestamp":1271857985000},"page":"686-696","source":"Crossref","is-referenced-by-count":2,"title":["Layered Working-Set Trees"],"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":"John","family":"Howat","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"59_CR1","doi-asserted-by":"publisher","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 Informatica\u00a01, 290\u2013306 (1972)","journal-title":"Acta Informatica"},{"issue":"2","key":"59_CR2","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"},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"Bose, P., Dou\u00efeb, K., Dujmovic, V., Howat, J.: Layered working-set trees. CoRR, abs\/0907.2071 (2009)","DOI":"10.1007\/978-3-642-12200-2_59"},{"issue":"1","key":"59_CR4","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1137\/S009753979732699X","volume":"30","author":"R. Cole","year":"1990","unstructured":"Cole, R.: On the dynamic finger conjecture for splay trees. Part II: the proof. SIAM Journal on Computing\u00a030(1), 44\u201385 (1990)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"59_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539797326988","volume":"30","author":"R. Cole","year":"1990","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 Journal on Computing\u00a030(1), 1\u201343 (1990)","journal-title":"SIAM Journal on Computing"},{"key":"59_CR6","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":"59_CR7","doi-asserted-by":"crossref","unstructured":"Derryberry, J.C., Sleator, D.D.: Skip-splay: Toward achieving the unified bound in the BST model. In: WADS 2009: Proceedings of the 16th Annual International Workshop on Algorithms and Data Structures, pp. 194\u2013205 (2009)","DOI":"10.1007\/978-3-642-03367-4_18"},{"key":"59_CR8","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: FOCS 1978: Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, pp. 8\u201321 (1978)","DOI":"10.1109\/SFCS.1978.3"},{"issue":"3","key":"59_CR9","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":"59_CR10","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":"59_CR11","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"}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T03:12:45Z","timestamp":1740021165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}