{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T22:40:28Z","timestamp":1737153628249,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729136"},{"type":"electronic","value":"9783540729143"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72914-3_13","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T09:37:26Z","timestamp":1182850646000},"page":"135-145","source":"Crossref","is-referenced-by-count":1,"title":["The Worst Page-Replacement Policy"],"prefix":"10.1007","author":[{"given":"Kunal","family":"Agrawal","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Bender","sequence":"additional","affiliation":[]},{"given":"Jeremy T.","family":"Fineman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/3-540-61680-2_72","volume-title":"Algorithms - ESA \u201996","author":"D. Achlioptas","year":"1996","unstructured":"Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. In: D\u00edaz, J. (ed.) ESA 1996. LNCS, vol.\u00a01136, pp. 419\u2013430. Springer, Heidelberg (1996)"},{"issue":"2","key":"13_CR2","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 computers. IBM Systems Journal\u00a05(2), 78\u2013101 (1966)","journal-title":"IBM Systems Journal"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1006\/jcss.1995.1021","volume":"50","author":"A. Borodin","year":"1995","unstructured":"Borodin, A., Irani, S., Raghavan, P., Schieber, B.: Competitive paging with locality of reference. Journal of Computer and System Sciences\u00a050(2), 244\u2013258 (1995)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"Fiat, A., Karp, R.M., Luby, M., McGeoch, L.A., Sleator, D.D., Young, N.E.: Competitive paging algorithms. Journal of Algorithms\u00a012(4), 685\u2013699 (1991)","journal-title":"Journal of Algorithms"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.:Cache-oblivious algorithms. In: 40th Annual Symposium on Foundations of Computer Science, pp. 285\u2013297, New York, October 17\u201319 (1999)","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"13_CR6","volume-title":"Computer Architecture: a Quantitative Approach","author":"J.L. Hennessy","year":"2003","unstructured":"Hennessy, J.L., Patterson, D.A.: Computer Architecture: a Quantitative Approach, 3rd edn. Morgan Kaufmann, San Francisco, CA (2003)","edition":"3"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BFb0029564","volume-title":"Developments from a June 1996 Seminar on Online Algorithms","author":"S. Irani","year":"1998","unstructured":"Irani, S.: Competitive analysis of paging. In: Fiat, A. (ed.) Developments from a June 1996 Seminar on Online Algorithms. LNCS, vol.\u00a01442, pp. 52\u201373. Springer, Heidelberg (1998)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1007\/BF01759073","volume":"6","author":"L.A. McGeoch","year":"1991","unstructured":"McGeoch, L.A., Sleator, D.D.: A strongly competitive randomized paging algorithm. Algorithmica\u00a06, 816\u2013825 (1991)","journal-title":"Algorithmica"},{"key":"13_CR9","unstructured":"Sandeep Sen and Siddhartha Chatterjee. Towards a theory of cache-efficient algorithms. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 829\u2013838, San Francisco, California (January 2000)"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Communications of the ACM"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"J.S. Vitter","year":"1985","unstructured":"Vitter, J.S.: Random sampling with a reservoir. ACM Transactions on Mathematical Software\u00a011(1), 37\u201357 (1985)","journal-title":"ACM Transactions on Mathematical Software"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72914-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T22:04:00Z","timestamp":1737151440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72914-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540729136","9783540729143"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72914-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}