{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T05:49:25Z","timestamp":1744868965473},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":7471,"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,2]]},"DOI":"10.1016\/0304-3975(93)90201-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"371-384","source":"Crossref","is-referenced-by-count":6,"title":["The weighted list update problem and the lazy adversary"],"prefix":"10.1016","volume":"108","author":[{"given":"Fabrizio","family":"d'Amore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Umberto","family":"Nanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90201-4_BIB1","unstructured":"Y. Azar and U. Nanni, personal communication, 1991."},{"key":"10.1016\/0304-3975(93)90201-4_BIB2","first-page":"379","article-title":"On the power of randomization in on-line algorithms","author":"Ben-David","year":"1990","journal-title":"Proc. 20th ACM Ann. Symp. on Theory of Computing"},{"issue":"4","key":"10.1016\/0304-3975(93)90201-4_BIB3","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"},{"issue":"1","key":"10.1016\/0304-3975(93)90201-4_BIB4","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/0208007","article-title":"Heuristics that dynamically organize data structures","volume":"8","author":"Bitner","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90201-4_BIB5","first-page":"249","article-title":"Competitive paging with locality of reference","author":"Borodin","year":"1991","journal-title":"Proc. 21st ACM Ann. Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(93)90201-4_BIB6","series-title":"Tech. Report","article-title":"Robust algorithms for diagnosis","author":"d'Amore","year":"1991"},{"key":"10.1016\/0304-3975(93)90201-4_BIB7","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","article-title":"Competitive paging algorithms","volume":"12","author":"Fiat","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(93)90201-4_BIB8","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1145\/322276.322285","article-title":"Dynamic programming as graph searching: An algebraic approach","volume":"28","author":"Gnesi","year":"1981","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/0304-3975(93)90201-4_BIB9","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)90201-4_BIB10","author":"Hofri and H. Shachnai","year":"1991","journal-title":"On the limited utility of auxiliary information in the list update problem"},{"key":"10.1016\/0304-3975(93)90201-4_BIB11","series-title":"Technical Report TR-90-037","article-title":"Two results on the list update problem","author":"Irani","year":"1990"},{"key":"10.1016\/0304-3975(93)90201-4_BIB12","first-page":"228","article-title":"Strongly competitive algorithms for paging with locality of reference","author":"Irani","year":"1992","journal-title":"Proc. 3rd ACM-SIAM Ann. Symp. on Discrete Algorithms"},{"key":"10.1016\/0304-3975(93)90201-4_BIB13","first-page":"251","article-title":"Randomized competitive algorithms for the list update problem","author":"Irani","year":"1991","journal-title":"Proc. 2nd ACM-SIAM Ann. Symp. on Discrete Algorithms"},{"issue":"1","key":"10.1016\/0304-3975(93)90201-4_BIB14","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","article-title":"Competitive snoopy catching","volume":"3","author":"Karlin","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(93)90201-4_BIB15","unstructured":"R. Karp and P. Raghavan, unpublished result, 1990."},{"key":"10.1016\/0304-3975(93)90201-4_BIB16","first-page":"322","article-title":"Competitive algorithms for on-line problems","author":"Manasse","year":"1988","journal-title":"Proc. 18th ACM Ann. Symp. on Theory of Computing"},{"issue":"2","key":"10.1016\/0304-3975(93)90201-4_BIB17","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(93)90201-4_BIB18","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1982"},{"key":"10.1016\/0304-3975(93)90201-4_BIB19","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","article-title":"A theory of diagnosis from first principles","volume":"32","author":"Reiter","year":"1987","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/0304-3975(93)90201-4_BIB20","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/359997.360000","article-title":"On self-organizing sequential search heuristics","volume":"19","author":"Rivest","year":"1976","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0304-3975(93)90201-4_BIB21","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"},{"issue":"2","key":"10.1016\/0304-3975(93)90201-4_BIB22","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. Alg. Disc. Meth."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593902014?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593902014?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:57:52Z","timestamp":1555077472000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397593902014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["0304397593902014"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90201-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}