{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:31:40Z","timestamp":1743028300036,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440406"},{"type":"electronic","value":"9783540456872"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45687-2_21","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:57:47Z","timestamp":1192784267000},"page":"257-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["More on Weighted Servers or Fifo is Better than Lru"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, B. Alpern, A. K. Chandra, and M. Snir. A model for hierarchical memory. In Proceedings of the 19th ACM Symposium on the Theory of Computing, pages 305\u2013313. ACM, 1987.","DOI":"10.1145\/28395.28428"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0020-0190(00)00140-X","volume":"76","author":"W. W. Bein","year":"2000","unstructured":"W. W. Bein, R. Fleischer, L. L. Larmore, Limited bookmark randomized online algorithms for the paging problem, Information Processing letters, 76: 155\u2013162, 2000.","journal-title":"Information Processing letters"},{"issue":"1\u20132","key":"21_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0020-0190(00)00034-X","volume":"74","author":"W. W. Bein","year":"2000","unstructured":"W. W. Bein, L. L. Larmore, Trackless online algorithms for the server problem, Information Processing letters, 74 no 1\u20132: 73\u201379, 2000.","journal-title":"Information Processing letters"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L. Belady","year":"1966","unstructured":"L. Belady, A study of replacement algorithms for virtual storage computers, IBM Systems Journal 5: 78\u2013101, 1966","journal-title":"IBM Systems Journal"},{"key":"21_CR5","unstructured":"Marek Chrobak and John Noga. Competitive algorithms for multilevel caching and relaxed list update (extended abstract). In Proceedings of the Ninth ACM-SIAM Symp. on Discrete Algorithms, pages 87\u201396. ACM\/SIAM, 1998."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/PL00009255","volume":"23","author":"M. Chrobak","year":"1999","unstructured":"M. Chrobak and J. Noga. LRU is better than FIFO. Algorithmica, 23:180\u2013185, 1999.","journal-title":"Algorithmica"},{"key":"21_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/3-540-46541-3_49","volume-title":"Proc. of STACS 2000","author":"M. Chrobak","year":"2000","unstructured":"M. Chrobak, J. Sgall, The weighted 2-server Problem, in Proc. of STACS 2000, LNCS 1770, Springer-Verlag Berlin, 593\u2013604, 2000."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(94)90154-6","volume":"130","author":"A. Fiat","year":"1994","unstructured":"A. Fiat, M. Ricklin, Competitive algorithms for the weighted server problem, Theoretical Computer Science, 130: 85\u201399, 1994.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A. Karlin","year":"1988","unstructured":"A. Karlin, M. Manasse, L. Rudolph, D. Sleator, Competitive snoopy caching, Algorithmica, 3(1): 79\u2013119, 1988.","journal-title":"Algorithmica"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M. Manasse","year":"1990","unstructured":"M. Manasse, L. A. McGeoch, and D. Sleator. Competitive algorithms for server problems. Journal of Algorithms, 11:208\u2013230, 1990.","journal-title":"Journal of Algorithms"},{"key":"21_CR11","unstructured":"L. Newberg, The K-server problem with distinguishable servers, Master\u2019s Thesis, Univ. of California at Berkeley, 1991."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"D. Sleator, R. E. Tarjan, Amortized efficiency of list update and paging rules, Communications of the ACM, 28:202\u2013208, 1985.","journal-title":"Communications of the ACM"},{"key":"21_CR13","unstructured":"N. Young, Online file caching, Proc. 9th Annual ACM-SIAM Symp. on Discrete Algorithms, 82\u201386, 1998 (to appear in Algorithmica)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2002"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45687-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T18:49:53Z","timestamp":1676054993000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45687-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440406","9783540456872"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45687-2_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"4 October 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}