{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:37:09Z","timestamp":1725521829079},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001423"},{"type":"electronic","value":"9783540361367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36136-7_3","type":"book-chapter","created":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T14:07:11Z","timestamp":1227622031000},"page":"25-31","source":"Crossref","is-referenced-by-count":2,"title":["Key Independent Optimality"],"prefix":"10.1007","author":[{"given":"John","family":"Iacono","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1137\/0209045","volume":"9","author":"M.R. Brown","year":"1980","unstructured":"M.R. Brown and R.E. Tarjan. Design and analysis of a data structure for representing sorted lists. SIAM J. Comput.,9:594\u2013614, 1980.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1137\/S009753979732699X","volume":"30","author":"R. Cole","year":"2000","unstructured":"R. Cole. On the dynamic finger conjecture for splay trees. part II: The proof. SIAM J. Comp., 30(1):44\u201385,2000.","journal-title":"SIAM J. Comp."},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539797326988","volume":"30","author":"R. Cole","year":"2000","unstructured":"R. Cole, B. Mishra, J. Schmidt, and A. Siegel. On the dynamic finger conjecture for splay trees. part I: Splay sorting log n-block sequences. SIAM J. Comp., 30(1):1\u201343, 2000.","journal-title":"SIAM J. Comp."},{"key":"3_CR4","unstructured":"M.L. Fredman, 2001. Private Communication."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"L.J. Guibas, E.M. McCreight, M.F. Plass, and J.R. Roberts. A new representation for linear lists. In Proc. 9th Ann. ACM Symp. on Theory of Computing, pages 49\u201360, 1977.","DOI":"10.1145\/800105.803395"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"J. Iacono. New upper bounds for pairing heaps. In Scandinavian Workshop on Algorithm Theory (LNCS 1851), pages 32\u201345, 2000.","DOI":"10.1007\/3-540-44985-X_5"},{"key":"3_CR7","unstructured":"J. Iacono. Alternatives to splay trees with o(logn)worst-case access times. In Symposium on Discrete Algorithms, pages 516\u2013522, 2001."},{"key":"3_CR8","series-title":"PhD thesis","volume-title":"Distribution Sensitive Data Structures","author":"J. Iacono","year":"2001","unstructured":"J. Iacono. Distribution Sensitive Data Structures. PhD thesis, Rutgers, The State University of New Jersey, Graduate School, New Brunswick, 2001"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF00264289","volume":"1","author":"D.E. Knuth","year":"1971","unstructured":"D.E. Knuth Optimum binary search trees. Acta inf., 1:14\u201325, 1971","journal-title":"Acta inf."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D.D. Sleator","year":"1985","unstructured":"D.D. Sleator and R.E. Tarjan. Self-adjusting binary trees. JACM, 32:652\u2013686, 1985","journal-title":"JACM"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"R. Wilbur. Lower bounds for accessing binary search trees with rotation. In Proc. 27th Symp. on foundation of Computer Science, pages 61\u201369, 1986","DOI":"10.1109\/SFCS.1986.28"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36136-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:28:58Z","timestamp":1557930538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36136-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001423","9783540361367"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-36136-7_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}