{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T12:57:29Z","timestamp":1760014649445},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_17","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T10:47:32Z","timestamp":1283338052000},"page":"195-206","source":"Crossref","is-referenced-by-count":9,"title":["Caching Is Hard \u2013 Even in the Fault Model"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haifeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Albers, S., Arora, S., Khanna, S.: Page replacement for general caching problems. In: Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 1999), pp. 31\u201340 (1999)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"A. Bar-Noy","year":"2000","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. Journal of the ACM\u00a048, 1069\u20131090 (2000)","journal-title":"Journal of the ACM"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L.A. Belady","year":"1966","unstructured":"Belady, L.A.: A study of replacement algorithms for virtual-storage computer. IBM Systems Journal\u00a05, 78\u2013101 (1966)","journal-title":"IBM Systems Journal"},{"key":"17_CR4","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/0404017","volume":"4","author":"M. Chrobak","year":"1991","unstructured":"Chrobak, M., Karloff, H.J., Payne, T.H., Vishwanathan, S.: New results on server problems. SIAM Journal on Discrete Mathematics\u00a04, 172\u2013181 (1991)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"17_CR6","unstructured":"Fiat, A.: Unpublished manuscript (1997)"},{"key":"17_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of $\\mathbb{NP}$ -Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of \n                    \n                      \n                    \n                    $\\mathbb{NP}$\n                  -Completeness. Freeman, San Francisco (1979)"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/s00453-001-0125-4","volume":"33","author":"S. Irani","year":"1997","unstructured":"Irani, S.: Page replacement with multi-size pages and applications to web caching. Algorithmica\u00a033, 384\u2013409 (1997)","journal-title":"Algorithmica"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s00453-001-0124-5","volume":"33","author":"N.E. Young","year":"1998","unstructured":"Young, N.E.: On-line file caching. Algorithmica\u00a033, 371\u2013383 (1998)","journal-title":"Algorithmica"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/TC.2004.1255792","volume":"53","author":"M. Brehob","year":"2004","unstructured":"Brehob, M., Wagner, S., Torng, E., Enbody, R.: Optimal replacement is NP-hard for non-standard caches. IEEE Trans. Computers\u00a053, 73\u201376 (2004)","journal-title":"IEEE Trans. Computers"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T03:44:32Z","timestamp":1552967072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}