{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:45Z","timestamp":1725488505277},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424239"},{"type":"electronic","value":"9783540446347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44634-6_14","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:20:48Z","timestamp":1186741248000},"page":"148-154","source":"Crossref","is-referenced-by-count":0,"title":["Competitive Analysis of the LRFU Paging Algorithm"],"prefix":"10.1007","author":[{"given":"Edith","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uri","family":"Zwick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"14_CR1","unstructured":"A. Borodin and R. El Yaniv. Online computation and competitive analysis. Cambridge University Press, 1998."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web caching and zipf-like distributions: Evidence and implications. In Proceedings of the IEEE INFOCOM\u201999 Conference, 1999.","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"14_CR3","unstructured":"P. Cao and S. Irani. Cost-Aware WWW proxy caching algorithms. In Proceedings of the USENIX Symposium on Internet Technologies and Systems, Monterey, California, December 1997. http:\/\/www.usenix.org\/events\/usits97 ."},{"key":"14_CR4","unstructured":"E. Cohen and H. Kaplan. LP-based analysis of greedy-dual-size. In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM, 1999."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"S. Irani. Page replacement with multi-size pages and applications to web caching. In Proc. 29th Annual ACM Symposium on Theory of Computing. ACM, 1997.","DOI":"10.1145\/258533.258666"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"D. Lee, J. Choi, J.-H. Kim, S. H. Noh, S. L. Min, Y. Cho, and S. Kim. On the existence of a spectrum of policies that subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) policies. In Proceedings of the ACM SIGMETRICS\u201999 Conference, 1999.","DOI":"10.1145\/301453.301487"},{"key":"14_CR7","unstructured":"Squid internet object cache. http:\/\/squid.nlanr.net\/Squid ."},{"key":"14_CR8","unstructured":"N. Young. On line file caching. In Proc. 9th ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM, 1998."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44634-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:12:11Z","timestamp":1556748731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44634-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424239","9783540446347"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44634-6_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}