{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:41:36Z","timestamp":1648597296026},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540638902","type":"print"},{"value":"9783540696629","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63890-3_44","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T21:12:11Z","timestamp":1270501931000},"page":"414-423","source":"Crossref","is-referenced-by-count":4,"title":["Generalized swap-with-parent schemes for self-organizing sequential linear lists"],"prefix":"10.1007","author":[{"given":"John","family":"Oommen","sequence":"first","affiliation":[]},{"given":"Juan","family":"Dong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"J. L. Bentley & C. C. McGeoch (1985). Amortized analyses of self-organizing sequential search heuristics. Proc. 20th Allerton Conference on Comm. Control, and Computing.","DOI":"10.1145\/3341.3349"},{"issue":"1","key":"44_CR2","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/0208007","volume":"8","author":"J. R. Bitner","year":"1979","unstructured":"J. R. Bitner (1979). Heuristics that dynamically organize data structures. SIAM J. Computing, 8, 1, pp. 82\u2013110.","journal-title":"SIAM J. Computing"},{"issue":"3","key":"44_CR3","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1137\/0210046","volume":"10","author":"G. H. Gonnet","year":"1981","unstructured":"G. H. Gonnet, J. I. Munro & H. Suwanda (1981). Exegesis of self-organizing linear search. SIAM J. Computing, 10, 3, pp. 613\u2013637.","journal-title":"SIAM J. Computing"},{"key":"44_CR4","doi-asserted-by":"crossref","first-page":"886","DOI":"10.2307\/3212392","volume":"10","author":"W. J. Hendricks","year":"1973","unstructured":"W. J. Hendricks (1973). An extension of a theorem concerning an interesting Markov chain. J. Appl. Prob. 10, pp886\u2013890.","journal-title":"J. Appl. Prob."},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"J. H. Hester & D. S. Hirschberg (1985). Self-organizing linear search. ACM Computing Surveys, pp. 295\u2013311.","DOI":"10.1145\/5505.5507"},{"key":"44_CR6","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1006\/jagm.1993.1049","volume":"15","author":"Hui","year":"1993","unstructured":"Hui & Martel (1993). Unsuccessful seach in self-adjusting data structures. Journal of Algorithms 15, pp.447\u2013481.","journal-title":"Journal of Algorithms"},{"key":"44_CR7","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.2307\/3213210","volume":"17","author":"Y. C. Kan","year":"1980","unstructured":"Y. C. Kan & S. M. Ross (1980). Optimal list order under partial memory constraints. J. Appl. Prob. 17, pp1004\u20131015.","journal-title":"J. Appl. Prob."},{"key":"44_CR8","unstructured":"F. P. Kelly (1987). Reversibility and Stochastic Networks. John Wiley & Sons, Chichester."},{"key":"44_CR9","unstructured":"D. E. Knuth (1973). The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, Ma."},{"key":"44_CR10","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1287\/opre.13.4.609","volume":"12","author":"J. McCabe","year":"1965","unstructured":"J. McCabe (1965). On serial files with relocatable records. Operations Research, 12, pp. 609\u2013618.","journal-title":"Operations Research"},{"key":"44_CR11","unstructured":"B. J. Oommen & J. Dong (1997). On the time reversibility of a well known selforganizing sequential search algorithm. Submitted for Publication."},{"key":"44_CR12","series-title":"Also available as a technical report from the School of Computer Science","volume-title":"Submitted for Publication","author":"B. J. Oommen","year":"1997","unstructured":"B. J. Oommen & J. Doug (1997). The swap-with-parent scheme: a self-organizing sequential search algorithm which uses non-lexicographic heaps. Submitted for Publication. Also available as a technical report from the School of Computer Science, Carleton University, Ottawa, Canada: KlS 5B5."},{"key":"44_CR13","unstructured":"B. J. Oommen & J. Dong (1997). Time Reversibility: A Mathematical Tool for Creating Arbitrary Generalized Swap-with-Parent Self-Organizing Lists. Unabridged version of this paper. Submitted for Publication."},{"key":"44_CR14","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1137\/0216047","volume":"16","author":"B. J. Oommen","year":"1987","unstructured":"B. J. Oommen & E. R. Hansen (1987). List organizing strategies using stochastic move-to-front and stochastic move-to-rear operations. SIAM J. Computing, 16, pp. 705\u2013716.","journal-title":"SIAM J. Computing"},{"key":"44_CR15","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(90)90136-6","volume":"74","author":"B. J. Oommen","year":"1990","unstructured":"B. J. Oommen, E. R. Hansen & J. I. Munro (1990). Deterministic optimal and expedient move-to-rear list organizing strategies. Theoretical Comp. Sci., 74, pp. 183\u2013197.","journal-title":"Theoretical Comp. Sci."},{"key":"44_CR16","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0304-3975(93)90166-Q","volume":"119","author":"B. J. Oommen","year":"1993","unstructured":"B. J. Oommen & D. T. H. Ng (1993). An optimal absorbing list organization strategy with constant memory requirements. Theoretical Comp. Sci., 119, pp. 355\u2013361.","journal-title":"Theoretical Comp. Sci."},{"key":"44_CR17","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/359997.360000","volume":"19","author":"R. L. Rivest","year":"1976","unstructured":"R. L. Rivest (1976). On self-organizing sequential search heuristics. Comm. ACM, 19, pp. 63\u201367.","journal-title":"Comm. ACM"},{"key":"44_CR18","volume-title":"Introduction to Probability Models","author":"S. M. Ross","year":"1980","unstructured":"S. M. Ross (1980). Introduction to Probability Models, 2nd edition. Academic Press, London.","edition":"2nd edition"},{"issue":"2","key":"44_CR19","first-page":"202","volume":"28","author":"Sleator","year":"1985","unstructured":"Sleator & Tarjan (1985). Amortized efficiency of list update and paging rules. Comm.A.C.M. 28(2), pp. 202\u2013208.","journal-title":"Comm.A.C.M."},{"key":"44_CR20","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1137\/0211046","volume":"11","author":"A. M. Tenenbaum","year":"1982","unstructured":"A. M. Tenenbaum & R. M. Nemes (1982). Two spectra of self-organizing sequential search algorithms. SIAM J. Computing, 11, pp. 557\u2013566","journal-title":"SIAM J. Computing"}],"container-title":["Algorithms and Computation","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63890-3_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T00:38:42Z","timestamp":1559003922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63890-3_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638902","9783540696629"],"references-count":20,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-63890-3_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1997]]}}}