{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:06Z","timestamp":1725663186507},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514862"},{"type":"electronic","value":"9783540481768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51486-4_85","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:58:43Z","timestamp":1330203523000},"page":"380-389","source":"Crossref","is-referenced-by-count":2,"title":["Generalizing singly-linked list reorganizing heuristics for doubly-linked lists"],"prefix":"10.1007","author":[{"given":"D. T. H.","family":"Ng","sequence":"first","affiliation":[]},{"given":"B. J.","family":"Oommen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"issue":"3","key":"33_CR1","doi-asserted-by":"crossref","first-page":"730","DOI":"10.2307\/3213536","volume":"19","author":"E. J. Anderson","year":"1982","unstructured":"Anderson, E.J., Nash, P. and Weber, R.R., A counter-example to a conjecture on optimal list ordering, J. Appl. Probl. 19, 3 (Sept.1982), pp. 730\u2013732.","journal-title":"J. Appl. Probl."},{"issue":"1","key":"33_CR2","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, 1 (Feb.1979), pp. 82\u2013110.","journal-title":"SIAM J. Comput."},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Gonnet, G.H., Munro, J.I., and Suwanda, H., Toward self-organizing linear search, Proceedings of the 20th IEEE Symposium on Foundations of Computer Science (San Juan, Puerto Rico, Oct. 1979). IEEE, New York, pp.169\u2013174.","DOI":"10.1109\/SFCS.1979.45"},{"issue":"3","key":"33_CR4","doi-asserted-by":"crossref","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, Comp. Surveys, Vol. 17, 3 (Sept.1985), pp. 295\u2013311.","journal-title":"Comp. Surveys"},{"issue":"1","key":"33_CR5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.2307\/3212655","volume":"9","author":"W. J. Hendricks","year":"1972","unstructured":"Hendricks, W.J., The stationary distribution of an interesting Markov chain, J.Appl.Probl. 9, 1 (Mar.1972), pp. 231\u2013233.","journal-title":"J.Appl.Probl."},{"issue":"4","key":"33_CR6","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 partial memory constraints, J. Appl. Prob. 17, 4 (Dec.1980), pp. 1004\u20131015.","journal-title":"J. Appl. Prob."},{"key":"33_CR7","first-page":"398","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, Mass.(1973), pp.398\u2013399."},{"key":"33_CR8","first-page":"99","volume":"8","author":"D. Matthews","year":"1980","unstructured":"Matthews, D., Self-organizing doubly linked lists, J.Comp. Maths., Sec.A, Vol.8 (1980), pp. 99\u2013106.","journal-title":"J.Comp. Maths., Sec.A"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"McCabe, J., On serial files with relocatable records, Oper. Res. (July.\/Aug. 65), 609\u2013618.","DOI":"10.1287\/opre.13.4.609"},{"key":"33_CR10","unstructured":"Ng, D.T.H. and Oommen, B.J., \"On Doubly-Linked List Reorganizing Heuristics\". Submitted for Publication. Also available as a technical report (SCS-TR-151) from the School of Computer Science, Carleton University, Ottawa, Canada: K1S 5B6."},{"issue":"4","key":"33_CR11","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1137\/0216047","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, SIAM Journal of Computing, Vol. 16, No.4, (Aug. 1987), pp 705\u2013716.","journal-title":"SIAM Journal of Computing"},{"key":"33_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."},{"issue":"2","key":"33_CR13","first-page":"63","volume":"19","author":"R. Rivest","year":"1976","unstructured":"Rivest, R., On self-organizing sequential search heuristics, Comm. CAM 19, 2 (Feb.1976), pp. 63\u201367.","journal-title":"Comm. CAM"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1989"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51486-4_85.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:28Z","timestamp":1605648088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51486-4_85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514862","9783540481768"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-51486-4_85","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}