{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:38Z","timestamp":1725663098516},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540501718"},{"type":"electronic","value":"9783540459439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-50171-1_10","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:15:34Z","timestamp":1330182934000},"page":"161-175","source":"Crossref","is-referenced-by-count":1,"title":["On using conditional rotation operations to adaptively structure binary search trees"],"prefix":"10.1007","author":[{"given":"R. P.","family":"Cheetham","sequence":"first","affiliation":[]},{"given":"B. J.","family":"Oommen","sequence":"additional","affiliation":[]},{"given":"D. T. H.","family":"Ng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"10_CR1","first-page":"1259","volume":"3","author":"G. M. Adel'son-Velski'i","year":"1962","unstructured":"Adel'son-Velski'i, G. M. and Landis, E.M., \"An algorithm for the organization of information\", Sov. Math. Dokl., 3(1962), pp. 1259\u20131262.","journal-title":"Sov. Math. Dokl."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1145\/322092.322094","volume":"25","author":"B. Allen","year":"1978","unstructured":"Allen, B. and Munro, I., \"Self-organizing binary search trees\", J.ACM 25(1978), pp. 526\u2013535.","journal-title":"J.ACM"},{"key":"10_CR3","unstructured":"Arnow, D. M. and Tenenbaum, A. M., \"An investigation of the move-ahead-k rules\", Congressus Numerantium, Proceedings of the Thirteenth Southeastern Conference on Combinatorics, Graph Theory and Computing, Florida, Feb. 1982, pp.47\u201365."},{"key":"10_CR4","unstructured":"Bayer, P. J., \"Improved bounds on the costs of optimal and balanced binary search trees\", MAC Technical Memo-69, Nov. 1975."},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/0208007","volume":"8","author":"J. R. Bitner","year":"1979","unstructured":"Bitner, J. R., \"Heuristics that dynamically organize data structures\", SIAM J.Comput., 8(1979), pp.82\u2013110.","journal-title":"SIAM J.Comput."},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1137\/0210046","volume":"10","author":"G. H. Gonnet","year":"1981","unstructured":"Gonnet, G. H., Munro, J. I. and Suwanda, H., \"Exegesis of self-organizing linear search\", SIAM J.Comput., 10(1981), pp.613\u2013637.","journal-title":"SIAM J.Comput."},{"key":"10_CR7","volume-title":"The Art of Computer Programming, vol. 3","author":"D. E. Knuth","year":"1973","unstructured":"Knuth, D. E., The Art of Computer Programming, vol. 3, Addison-Wesley, Reading, Ma., 1973."},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1287\/opre.13.4.609","volume":"12","author":"J. McCabe","year":"1965","unstructured":"McCabe, J., \"On serial files with relocatable records\", Operations Research, 12(1965), pp.609\u2013618.","journal-title":"Operations Research"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF00264563","volume":"5","author":"K. Mehlhorn","year":"1975","unstructured":"Mehlhorn, K., \"Nearly optimal binary search trees\", Acta Informatica, 5(1975), pp.287\u2013295.","journal-title":"Acta Informatica"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Oommen, B.J. and Hansen, E. R., \"List organizing strategies using stochastic move-to-front and stochastic move-to-rear operations\", SIAM J.Comput., vol.16, No.4, pp. 705\u2013716.","DOI":"10.1137\/0216047"},{"key":"10_CR11","unstructured":"Oommen, B. J., Hansen, E. R. and Munro, J. I., \"Deterministic Move-to-Rear List Organizing Strategies with Optimal and Expedient Properties\", Proc. of the Twenty-Fifth Allerton Conference, Sept. 1987."},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/359997.360000","volume":"19","author":"R. L. Rivest","year":"1976","unstructured":"Rivest, R. L., \"On self-organizing sequential search heuristics\", Comm. ACM, 19(1976), pp.63\u201367.","journal-title":"Comm. ACM"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D. D. Sleator","year":"1985","unstructured":"Sleator, D. D. and Tarjan, R. E., \"Self-adjusting binary search trees\", J.ACM, 32(1985), pp.652\u2013686.","journal-title":"J.ACM"},{"key":"10_CR14","volume-title":"Graph Theory and Computing","author":"W. A. Walker","year":"1972","unstructured":"Walker, W. A. and Gotlieb, C. C., \"A top-down algorithm for constructing nearly optimal lexicographical trees\", in Graph Theory and Computing, Academic Press, New York, 1972."},{"key":"10_CR15","unstructured":"Cheetham, R. P., Oommen, B. J. and Ng, D. T. H., \"Adaptive Structuring of Binary Search Trees Using Conditional Rotations\". Submitted for publication."}],"container-title":["Lecture Notes in Computer Science","ICDT '88"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50171-1_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:17:26Z","timestamp":1605629846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50171-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540501718","9783540459439"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-50171-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1983]]}}}