{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T11:18:12Z","timestamp":1718623092197},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,5,13]],"date-time":"2008-05-13T00:00:00Z","timestamp":1210636800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s00224-008-9114-1","type":"journal-article","created":{"date-parts":[[2008,5,12]],"date-time":"2008-05-12T19:34:45Z","timestamp":1210620885000},"page":"175-185","source":"Crossref","is-referenced-by-count":1,"title":["The Worst Page-Replacement Policy"],"prefix":"10.1007","volume":"44","author":[{"given":"Kunal","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Bender","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy T.","family":"Fineman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,13]]},"reference":[{"key":"9114_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/3-540-61680-2_72","volume-title":"Annual European Symposium on Algorithms (ESA)","author":"D. Achlioptas","year":"1996","unstructured":"Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. In: Annual European Symposium on Algorithms (ESA), Barcelona, Spain, 25\u201327 September 1996. Lecture Notes in Computer Science, vol. 1136, pp. 419\u2013430. Springer, Berlin (1996)"},{"issue":"2","key":"9114_CR2","doi-asserted-by":"crossref","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 Syst. J. 5(2), 78\u2013101 (1966)","journal-title":"IBM Syst. J."},{"issue":"2","key":"9114_CR3","doi-asserted-by":"crossref","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. J.\u00a0Comput. Syst. Sci. 50(2), 244\u2013258 (1995)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"issue":"4","key":"9114_CR4","doi-asserted-by":"crossref","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. J. Algorithms 12(4), 685\u2013699 (1991)","journal-title":"J. Algorithms"},{"key":"9114_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, New York, 17\u201319 October 1999, pp. 285\u2013297 (1999)","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"9114_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 (2003)","edition":"3"},{"key":"9114_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: Developments from a June 1996 Seminar on Online Algorithms, London, UK. Lecture Notes in Computer Science, vol. 1442, pp. 52\u201373. Springer, Berlin (1998)"},{"key":"9114_CR8","doi-asserted-by":"crossref","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 6, 816\u2013825 (1991)","journal-title":"Algorithmica"},{"key":"9114_CR9","unstructured":"Sen, S., Chatterjee, S.: Towards a theory of cache-efficient algorithms. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, California, January 2000, pp. 829\u2013838 (2000)"},{"issue":"2","key":"9114_CR10","doi-asserted-by":"crossref","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. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"issue":"1","key":"9114_CR11","doi-asserted-by":"crossref","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 Trans. Math. Softw. 11(1), 37\u201357 (1985)","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-008-9114-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-008-9114-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-008-9114-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:36Z","timestamp":1558698696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-008-9114-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,13]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["9114"],"URL":"https:\/\/doi.org\/10.1007\/s00224-008-9114-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,13]]}}}