{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T14:11:24Z","timestamp":1648995084616},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7229,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1016\/0304-3975(93)90166-q","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"355-361","source":"Crossref","is-referenced-by-count":2,"title":["An optimal absorbing list organization strategy with constant memory requirements"],"prefix":"10.1016","volume":"119","author":[{"given":"B.John","family":"Oommen","sequence":"first","affiliation":[]},{"given":"David T.H.","family":"Ng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90166-Q_BIB1","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1137\/0210046","article-title":"Exegesis of self organizing linear search","volume":"10","author":"Gonnet","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90166-Q_BIB2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/5505.5507","article-title":"Self-organizing linear search","volume":"17","author":"Hester","year":"1985","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0304-3975(93)90166-Q_BIB3","series-title":"Markov Chains: Theory and Applications","author":"Isaacson","year":"1976"},{"key":"10.1016\/0304-3975(93)90166-Q_BIB4","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1137\/0216047","article-title":"List organizing strategies using stochastic move-to-front and stochastic move-to-rear operations","volume":"16","author":"Oommen","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90166-Q_BIB5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(90)90136-6","article-title":"Deterministic optimal and expedient move-to-rear list organizing strategies","volume":"74","author":"Oommen","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90166-Q_BIB6","series-title":"M.Sc. Thesis","article-title":"Learning systems, adaptive data structures and random environments","author":"Ng","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390166Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390166Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:24:42Z","timestamp":1555129482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390166Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["030439759390166Q"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90166-q","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}