{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:59:53Z","timestamp":1725487193027},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441809"},{"type":"electronic","value":"9783540457497"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_45","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T15:42:44Z","timestamp":1183563764000},"page":"499-511","source":"Crossref","is-referenced-by-count":4,"title":["Online Companion Caching"],"prefix":"10.1007","author":[{"given":"Amos","family":"Fiat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manor","family":"Mendel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven S.","family":"Seiden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"45_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0304-3975(98)00116-9","volume":"234","author":"D. Achlioptas","year":"2000","unstructured":"D. Achlioptas, M. Chrobak, and J. Noga. Competitive analysis of randomized paging algorithms. Theoretical Computer Science, 234:203\u2013218, 2000.","journal-title":"Theoretical Computer Science"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L.A. Belady","year":"1966","unstructured":"L.A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78\u2013101, 1966.","journal-title":"IBM Systems Journal"},{"key":"45_CR3","unstructured":"M. Brehob, R. Enbody, E. Torng, and S. Wagner. On-line restricted caching. In Proceedings of the 12th Symposium on Discrete Algorithms, pages 374\u2013383, 2001."},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"A. Fiat, R. Karp, M. Luby, L. A. McGeoch, D. D. Sleator, and N.E. Young. Competitive paging algorithms. Journal of Algorithms, 12:685\u2013699, 1991.","journal-title":"Journal of Algorithms"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"N. Jouppi. Improvingdi rect-mapped cache by the addition of small fullyassociative cache and prefetch buffer. Proc. of the 17th International Symposiuom on Computer Architecture, 18(2):364\u2013373, 1990.","DOI":"10.1145\/325096.325162"},{"issue":"1","key":"45_CR6","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, and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79\u2013119, 1988.","journal-title":"Algorithmica"},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1007\/BF01759073","volume":"6","author":"L. McGeoch","year":"1991","unstructured":"L. McGeoch and D.D. Sleator. A strongly competitive randomized paging algorithm. J. Algorithms, 6:816\u2013825, 1991.","journal-title":"J. Algorithms"},{"key":"45_CR8","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communication of the ACM, 28:202\u2013208, 1985.","journal-title":"Communication of the ACM"},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"A. Seznec. A case for two-way skewed-associative caches. In Proc. of the 20th International Symposuim on Computer Architecture pages 169\u2013178, 1993.","DOI":"10.1145\/165123.165152"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T03:06:38Z","timestamp":1556593598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45749-6_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_45","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}