{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:58Z","timestamp":1725663478359},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540518594"},{"type":"electronic","value":"9783540468318"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51859-2_11","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:18:18Z","timestamp":1330186698000},"page":"115-125","source":"Crossref","is-referenced-by-count":0,"title":["Optimal constant space move-to-fear list organization"],"prefix":"10.1007","author":[{"given":"B. John","family":"Oommen","sequence":"first","affiliation":[]},{"given":"David T. H.","family":"Ng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"11_CR1","first-page":"47","volume-title":"An Investigation of the Move-Ahead-k Rules","author":"D.M. Arnow","year":"1982","unstructured":"Arnow, D.M. and Tenebaum, A.M., \"An Investigation of the Move-Ahead-k Rules\", Congressus Numerantium, Proc. of the Thirteenth Southeastern Conference on Combinatorics, Graph Theory and Computing, Florida, February 1982, pp. 47\u201365."},{"key":"11_CR2","doi-asserted-by":"publisher","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., Vol.8, 1979, pp. 82\u2013110.","journal-title":"SIAM J. Comput."},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"697","DOI":"10.2307\/3212792","volume":"10","author":"P.J. Burville","year":"1973","unstructured":"Burville, P.J. and Kingman, J.F.C., \"On a Model for Storage and Search\", J. Appl. Probability, Vol.10, 1973, pp. 697\u2013701.","journal-title":"J. Appl. Probability"},{"key":"11_CR4","doi-asserted-by":"publisher","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., Vol.10, 1981, pp.613\u2013637.","journal-title":"SIAM J. Comput."},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.2307\/3212392","volume":"10","author":"W.J. Hendricks","year":"1973","unstructured":"Hendricks, W.J., \"An Extension of a Theorem Concerning an Interesting Markov Chain\", J. App. Probability, Vol.10, 1973, pp.231\u2013233.","journal-title":"J. App. Probability"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/5505.5507","volume":"17","author":"J.H. Hester","year":"1985","unstructured":"Hester, J.H. and Hirschberg, D.S., \"Self-Organizing Linear Search\", ACM Computing Surveys, Vol. 17, 1985, pp.295\u2013311.","journal-title":"ACM Computing Surveys"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.2307\/3213210","volume":"17","author":"Y.C. Kan","year":"1980","unstructured":"Kan, Y.C. and Ross, S.M., \"Optimal List Order Under Partial Memory Constraints\", J. App. Probability, Vol.17, 1980, pp. 1004\u20131015.","journal-title":"J. App. Probability"},{"key":"11_CR8","volume-title":"Markov Chains: Theory and Applications","author":"D.L. Isaacson","year":"1976","unstructured":"Isaacson, D.L. and Madsen, R.W., \"Markov Chains: Theory and Applications\" New York, John Wiley & Son, 1976."},{"key":"11_CR9","volume-title":"The Art of Computer Programming, Vol.3, Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E., \"The Art of Computer Programming, Vol.3, Sorting and Searching\", Addison-Wesley, Reading, MA., 1973."},{"key":"11_CR10","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, Vol.12, 1965, pp.609\u2013618.","journal-title":"Operations Research"},{"key":"11_CR11","first-page":"705","volume":"16","author":"B.J. Oommen","year":"1987","unstructured":"Oommen, B.J. and Hansen, E.R., \"List Organizing Strategies Using Stochastic Move-to-front and Stochastic Move-to-Rear Operations\", to appear in SIAM Journal on Computing. Vol. 16, (1987), 705\u2013716.","journal-title":"Journal on Computing"},{"key":"11_CR12","unstructured":"Oommen, B.J., Hansen, E.R. and Munro, J.I., \"Deterministic Optimal and Expedient Move-To-Rear List Organizing Strategies\", to appear in Theoretical Computer Science (Preliminary abridged version was published in the Proc. of the 25th Annual Allerton Conference, Urbana, Illinois, Sept\/Oct. 1987, pp.54\u201363)."},{"key":"11_CR13","doi-asserted-by":"publisher","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, Vol.19, 1976, pp.63\u201367.","journal-title":"Comm. ACM"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Sleator, D. and Tarjan, R., \"Amortized Efficiency of List Update Rules\", Proc. of the Sixteenth Annual ACM Symposium on Theory of Computing, April 1984, pp. 488\u2013492.","DOI":"10.1145\/800057.808718"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1137\/0211046","volume":"11","author":"A.M. Tenenbaum","year":"1982","unstructured":"Tenenbaum, A.M. and Nemes, R.M., \"Two Spectra of Self-Organizing Sequential Search Algorithms\", SIAM J. Comput., Vol.11, 1982, pp-557\u2013566.","journal-title":"SIAM J. Comput."},{"key":"11_CR16","unstructured":"Oommen, B.J., Ng, D.T.H., \"Ideal List Organization for Stationary Environments\", Submitted for publication. Also available as a Technical Report from the School of Computer Science, Carleton University, Ottawa K1S 5B6, CANADA."}],"container-title":["Lecture Notes in Computer Science","Optimal Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51859-2_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:23:03Z","timestamp":1605630183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51859-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540518594","9783540468318"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-51859-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}