{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:06:54Z","timestamp":1648512414472},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"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,9]]},"DOI":"10.1016\/s0304-3975(03)00287-1","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T19:58:54Z","timestamp":1053374334000},"page":"305-317","source":"Crossref","is-referenced-by-count":3,"title":["More on weighted servers or FIFO is better than LRU"],"prefix":"10.1016","volume":"306","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[]},{"given":"Csan\u00e1d","family":"Imreh","sequence":"additional","affiliation":[]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00287-1_BIB1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, B. Alpern, A.K. Chandra, M. Snir, A model for hierarchical memory, in: Proc. 19th ACM Symp. on the Theory of Computing, ACM, New York, 1987, pp. 305\u2013313.","DOI":"10.1145\/28395.28428"},{"key":"10.1016\/S0304-3975(03)00287-1_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."},{"issue":"1\u20132","key":"10.1016\/S0304-3975(03)00287-1_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(03)00287-1_BIB4","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.52.0078","article-title":"A study of replacement algorithms for virtual storage computers","volume":"5","author":"Belady","year":"1966","journal-title":"IBM Systems J."},{"key":"10.1016\/S0304-3975(03)00287-1_BIB5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/PL00009255","article-title":"LRU is better than FIFO","volume":"23","author":"Chrobak","year":"1999","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/S0304-3975(03)00287-1_BIB6","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1006\/jagm.1999.1061","article-title":"Competitive algorithms for multilevel caching and relaxed list update","volume":"34","author":"Chrobak","year":"2000","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(03)00287-1_BIB7","doi-asserted-by":"crossref","unstructured":"M. Chrobak, J. Sgall, The weighted 2-server Problem, in: Proc. STACS 2000, Lecture Notes in Computer Science, Vol. 1770, Springer, Berlin, 2000, pp. 593\u2013604.","DOI":"10.1007\/3-540-46541-3_49"},{"key":"10.1016\/S0304-3975(03)00287-1_BIB8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(94)90154-6","article-title":"Competitive algorithms for the weighted server problem","volume":"130","author":"Fiat","year":"1994","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(03)00287-1_BIB9","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\/S0304-3975(03)00287-1_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"},{"key":"10.1016\/S0304-3975(03)00287-1_BIB11","unstructured":"L. Newberg, The K-server problem with distinguishable servers, Master's Thesis, University of California at Berkeley, 1991."},{"key":"10.1016\/S0304-3975(03)00287-1_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":"Comm. ACM"},{"issue":"3","key":"10.1016\/S0304-3975(03)00287-1_BIB13","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s00453-001-0124-5","article-title":"On-line file caching","volume":"33","author":"Young","year":"2002","journal-title":"Algorithmica"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002871?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002871?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T09:22:14Z","timestamp":1553160134000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503002871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0304397503002871"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00287-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}