{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:40:30Z","timestamp":1742600430381,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609223"},{"type":"electronic","value":"9783540497233"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60922-9_48","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:04:32Z","timestamp":1330290272000},"page":"593-603","source":"Crossref","is-referenced-by-count":6,"title":["On competitive on-line paging with lookahead"],"prefix":"10.1007","author":[{"given":"Dany","family":"Breslauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"48_CR1","first-page":"1","volume-title":"number 726 in Lecture Notes in Computer Science","author":"S. Albers","year":"1993","unstructured":"S. Albers. The Influence of Lookahead in Competitive Paging Algorithms. In Proc. 1st European Symposium on Algorithms, number 726 in Lecture Notes in Computer Science, pages 1\u201312. Springer-Verlag, Berlin, Germany, 1993."},{"issue":"2","key":"48_CR2","doi-asserted-by":"crossref","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 a virtual-storage computer. IBM Systems Journal, 5(2):78\u2013101, 1966.","journal-title":"IBM Systems Journal"},{"key":"48_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01294264","volume":"11","author":"S. Ben-David","year":"1994","unstructured":"S. Ben-David and A. Borodin. A New Measure for the Study of On-Line Algorithms. Algorithmica, 11:73\u201391, 1994.","journal-title":"Algorithmica"},{"key":"48_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. McGeoch, D.D. Sleator, and N.E. Young. Competitive Paging Algorithms. J. Algorithms, 12:685\u2013699, 1991.","journal-title":"J. Algorithms"},{"key":"48_CR5","unstructured":"E.F. Grove. Online Bin Packing with Lookahead. In Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, pages 430\u2013436, 1995."},{"key":"48_CR6","volume-title":"PhD thesis","author":"E. Koutsoupias","year":"1994","unstructured":"E. Koutsoupias. On-Line Algorithms and the k-server Conjecture. PhD thesis, Dept. of Computer Science and Engineering, University of California, San Diego, 1994."},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"E. Koutsoupias and C.H. Papadimitriou. Beyond Competitive Analysis. In Proc. 35th IEEE Symp. on Foundations of Computer Science, pages 394\u2013400, 1994.","DOI":"10.1109\/SFCS.1994.365677"},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1007\/BF01759073","volume":"6","author":"L.A. McGeoch","year":"1991","unstructured":"L.A. McGeoch and D.D. Sleator. A strongly competitive randomized paging algorithm. Algorithmica, 6:816\u2013825, 1991.","journal-title":"Algorithmica"},{"issue":"2","key":"48_CR9","doi-asserted-by":"crossref","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. Comm. of the ACM, 28(2):202\u2013208, 1985.","journal-title":"Comm. of the ACM"},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"E. Torng. A Unified Analysis of Paging and Caching. In Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995. To appear.","DOI":"10.1109\/SFCS.1995.492476"},{"key":"48_CR11","unstructured":"N. Young. Competitive Paging and Dual-Guided On-Line Weighted Caching and Matching Algorithms. PhD thesis, Dept. of Computer Science, Princeton University, 1991."},{"key":"48_CR12","unstructured":"N. Young. On-Line Caching as Cache Size Varies. In Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, pages 241\u2013250, 1991."}],"container-title":["Lecture Notes in Computer Science","STACS 96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60922-9_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:42Z","timestamp":1742598642000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60922-9_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609223","9783540497233"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-60922-9_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}