{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T15:47:24Z","timestamp":1648914444010},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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":6925,"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":[[1994,8]]},"DOI":"10.1016\/0304-3975(94)00010-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"101-123","source":"Crossref","is-referenced-by-count":1,"title":["The list update problem and the retrieval of sets"],"prefix":"10.1016","volume":"130","author":[{"given":"Fabrizio","family":"d'Amore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"Liberatore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00010-7_BIB1","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1145\/100216.100268","article-title":"On the power of randomization in on-line algorithms","author":"Ben-David","year":"1990","journal-title":"Proc. 22nd Ann. ACM Symp. on Theory Comput. (STOC '90)"},{"key":"10.1016\/0304-3975(94)00010-7_BIB2","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1145\/3341.3349","article-title":"Amortized analyses of self-organizing sequential search heuristics","volume":"28","author":"Bentley","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(94)00010-7_BIB3","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1137\/0220008","article-title":"An optimal on-line algorithm for k-servers on trees","volume":"20","author":"Chrobak","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00010-7_BIB4","first-page":"178","article-title":"The list update problem and the retrieval of sets","volume":"Vol. 621","author":"d'Amore","year":"1992"},{"key":"10.1016\/0304-3975(94)00010-7_BIB5","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0304-3975(93)90201-4","article-title":"The weighted list update problem and the lazy adversary","volume":"108","author":"d'Amore","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00010-7_BIB6","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/103418.103448","article-title":"The harmonic on-line K-server algorithm is competitive","author":"Grove","year":"1991","journal-title":"Proc. 23rd Annual ACM Symp. on Theory Comput. (STOC '91)"},{"key":"10.1016\/0304-3975(94)00010-7_BIB7","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(94)00010-7_BIB8","series-title":"Techn. Report TR-90-037","article-title":"Two results on the list update problem","author":"Irani","year":"1990"},{"key":"10.1016\/0304-3975(94)00010-7_BIB9","first-page":"251","article-title":"Randomized competitive algorithms for the list udate problem","author":"Irani","year":"1991","journal-title":"Proc. 2nd ACM-SIAM Annual. Symp. on Disc. Algorithms (SODA '91)"},{"key":"10.1016\/0304-3975(94)00010-7_BIB10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","article-title":"Competitive snoopy caching","volume":"3","author":"Karlin","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(94)00010-7_BIB11","unstructured":"R. Karp and P. Raghavan, Private communication reported in [8]."},{"key":"10.1016\/0304-3975(94)00010-7_BIB12","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/62212.62243","article-title":"Competitive algorithms for on-line problems","author":"Manasse","year":"1988","journal-title":"Proc. 20th Annual ACM Symp. Theory Comput. (STOC '88)"},{"key":"10.1016\/0304-3975(94)00010-7_BIB13","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","article-title":"Competitive algorithms for server problems","volume":"11","author":"Manasse","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(94)00010-7_BIB14","series-title":"Techn. Report YALEU\/DCS\/TR-805","article-title":"Optimum off-line algorithms for the list update problem","author":"Reingold","year":"1990"},{"key":"10.1016\/0304-3975(94)00010-7_BIB15","unstructured":"D.D. Sleator, Private communication reported in [8]."},{"key":"10.1016\/0304-3975(94)00010-7_BIB16","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(94)00010-7_BIB17","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","article-title":"Self-adjusting binary search trees","volume":"32","author":"Sleator","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00010-7_BIB18","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","article-title":"Amortized computational complexity","volume":"6","author":"Tarjan","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0304-3975(94)00010-7_BIB19","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0020-0190(93)90150-8","article-title":"Lower bound for randomized list update algorithms","volume":"47","author":"Teia","year":"1993","journal-title":"Inform. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594000107?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594000107?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:27:59Z","timestamp":1555115279000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594000107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0304397594000107"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00010-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}