{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:53:39Z","timestamp":1782834819337,"version":"3.54.5"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":3850,"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":[[2003,1]]},"DOI":"10.1016\/s0304-3975(02)00045-2","type":"journal-article","created":{"date-parts":[[2003,2,5]],"date-time":"2003-02-05T01:51:53Z","timestamp":1044409913000},"page":"1997-2008","source":"Crossref","is-referenced-by-count":7,"title":["More on randomized on-line algorithms for caching"],"prefix":"10.1016","volume":"290","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elias","family":"Koutsoupias","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Noga","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00045-2_BIB1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0304-3975(98)00116-9","article-title":"Competitive analysis of randomized paging algorithms","volume":"234","author":"Achlioptas","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00045-2_BIB2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0020-0190(00)00140-X","article-title":"Limited bookmark randomized online algorithms for the paging problem","volume":"76","author":"Bein","year":"2000","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(02)00045-2_BIB3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0020-0190(00)00034-X","article-title":"Trackless online algorithms for the server problem","volume":"74","author":"Bein","year":"2000","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(02)00045-2_BIB4","series-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"1998"},{"key":"10.1016\/S0304-3975(02)00045-2_BIB5","unstructured":"M. Chrobak, E. Koutsoupias, J. Noga, More on randomized on-line algorithms for caching: simplicity vs competitiveness, Technical Report UCR-CSE-01-02, Department of Computer Science and Engineering, University of California, Riverside, 2001."},{"key":"10.1016\/S0304-3975(02)00045-2_BIB6","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1137\/0220008","article-title":"An optimal online algorithm for k servers on trees","volume":"20","author":"Chrobak","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00045-2_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\/S0304-3975(02)00045-2_BIB8","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1145\/210118.210128","article-title":"On the k-server conjecture","volume":"42","author":"Koutsoupias","year":"1995","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"10.1016\/S0304-3975(02)00045-2_BIB9","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/S0097539796299540","article-title":"Beyond competitive analysis","volume":"30","author":"Koutsoupias","year":"2000","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00045-2_BIB10","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"},{"issue":"6","key":"10.1016\/S0304-3975(02)00045-2_BIB11","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1007\/BF01759073","article-title":"A strongly competitive randomized paging algorithm","volume":"6","author":"McGeoch","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(02)00045-2_BIB12","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":"Commun. ACM"},{"key":"10.1016\/S0304-3975(02)00045-2_BIB13","series-title":"Principles of Random Walks","author":"Spitzer","year":"1976"},{"issue":"1","key":"10.1016\/S0304-3975(02)00045-2_BIB14","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1006\/jagm.2000.1099","article-title":"On-line paging against adversarially biased random inputs","volume":"37","author":"Young","year":"2000","journal-title":"J. Algorithms"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000452?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000452?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T13:52:41Z","timestamp":1556718761000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502000452"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397502000452"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00045-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}