{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:55Z","timestamp":1725543475812},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540357537"},{"type":"electronic","value":"9783540357551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785293_14","type":"book-chapter","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T01:24:10Z","timestamp":1151285050000},"page":"124-135","source":"Crossref","is-referenced-by-count":0,"title":["Paging with Request Sets"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tami","family":"Tamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0304-3975(98)00116-9","volume":"234","author":"D. Achlioptas","year":"2000","unstructured":"Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. Theoretical Comp. Science\u00a0234(1-2), 203\u2013218 (2000)","journal-title":"Theoretical Comp. Science"},{"key":"14_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, 78\u2013101 (1966)","journal-title":"IBM Systems Journal"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Borodin, A., Linial, N., Saks, M.: An optimal online algorithm for metrical task systems. In: Proc. 19th ACM Symp. on Theory of Computing (1987)","DOI":"10.1145\/28395.28435"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Larmore, L.L.: The server problem and on-line games. DIMACS Series in Discrete Math. and Theoretical Comp. Science, vol.\u00a07 (1992)","DOI":"10.1090\/dimacs\/007\/02"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.tcs.2004.08.015","volume":"332","author":"M. Demange","year":"2005","unstructured":"Demange, M., Paschos, V.T.: On-line vertex-covering. Theoretical Computer Science\u00a0332, 83\u2013108 (2005)","journal-title":"Theoretical Computer Science"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. In: Proc. 35th ACM Symp. on Theory of Comp., pp. 595\u2013601 (2003)","DOI":"10.1145\/780542.780629"},{"key":"14_CR7","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., Luby, M., McGeoch, L.A., Sleator, D., Young, N.E.: Competitive paging algorithms. Journal of Algorithms\u00a012, 685\u2013699 (1991)","journal-title":"Journal of Algorithms"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(94)90154-6","volume":"130","author":"A. Fiat","year":"1994","unstructured":"Fiat, A., Ricklin, M.: Competitive algorithms for the weighted server problem. Theoretical Computer Science\u00a0130, 85\u201399 (1994)","journal-title":"Theoretical Computer Science"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0029564","volume-title":"Online Algorithms: The State of Art","author":"S. Irani","year":"1998","unstructured":"Irani, S.: Competitive analysis of paging. In: Fiat, A., Woeginger, G. (eds.) Online Algorithms: The State of Art, pp. 52\u201373. Springer, Heidelberg (1998)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A. Karlin","year":"1988","unstructured":"Karlin, A., Manasse, M., Rudolph, L., Sleator, D.: Competitive snoopy caching. Algorithmica\u00a03, 79\u2013119 (1988)","journal-title":"Algorithmica"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M. Manasse","year":"1990","unstructured":"Manasse, M., McGeoch, L.A., Sleator, D.: Competitive algorithms for server problems. Journal of Algorithms\u00a011, 208\u2013230 (1990)","journal-title":"Journal of Algorithms"},{"issue":"6","key":"14_CR12","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1007\/BF01759073","volume":"6","author":"L. McGeoch","year":"1991","unstructured":"McGeoch, L., Sleator, D.: A strongly competitive randomized paging algorithm. Algorithmica\u00a06(6), 816\u2013825 (1991)","journal-title":"Algorithmica"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP. In: Proc. 29th ACM Symp. on Theory of Comp., pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028, 202\u2013208 (1985)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785293_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T11:39:22Z","timestamp":1555673962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785293_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357537","9783540357551"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11785293_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}