{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:21:36Z","timestamp":1725740496886},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_17","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:36:30Z","timestamp":1373506590000},"page":"195-206","source":"Crossref","is-referenced-by-count":3,"title":["Relative Interval Analysis of Paging Algorithms on Access Graphs"],"prefix":"10.1007","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[]},{"given":"Sushmita","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.jcss.2004.08.002","volume":"70","author":"S. Albers","year":"2005","unstructured":"Albers, S., Favrholdt, L.M., Giel, O.: On paging with locality of reference. Journal of Computer and System Sciences\u00a070(2), 145\u2013175 (2005)","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR2","unstructured":"Angelopoulos, S., Dorrigiv, R., L\u00f3pez-Ortiz, A.: On the separation and equivalence of paging strategies. In: SODA 2007, pp. 229\u2013237 (2007)"},{"key":"17_CR3","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)"},{"issue":"2","key":"17_CR4","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":"2","key":"17_CR5","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/1240233.1240245","volume":"3","author":"J. Boyar","year":"2007","unstructured":"Boyar, J., Favrholdt, L.M.: The relative worst order ratio for on-line algorithms. ACM Transactions on Algorithms 3(2), article No.\u00a022 (2007)","journal-title":"ACM Transactions on Algorithms"},{"issue":"5","key":"17_CR6","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1016\/j.jcss.2007.03.001","volume":"73","author":"J. Boyar","year":"2007","unstructured":"Boyar, J., Favrholdt, L.M., Larsen, K.S.: The relative worst order ratio applied to paging. Journal of Computer and System Sciences\u00a073(5), 818\u2013843 (2007)","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-31155-0_29","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"J. Boyar","year":"2012","unstructured":"Boyar, J., Gupta, S., Larsen, K.S.: Access graphs results for LRU versus FIFO under relative worst order analysis. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol.\u00a07357, pp. 328\u2013339. Springer, Heidelberg (2012)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Boyar, J., Gupta, S., Larsen, K.S.: Relative interval analysis of paging algorithms on access graphs, arXiv:1305.0669 (cs.DS) (2013)","DOI":"10.1007\/978-3-642-40104-6_17"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-03367-4_11","volume-title":"Algorithms and Data Structures","author":"J. Boyar","year":"2009","unstructured":"Boyar, J., Irani, S., Larsen, K.S.: A comparison of performance measures for online algorithms. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 119\u2013130. Springer, Heidelberg (2009)"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/PL00009255","volume":"23","author":"M. Chrobak","year":"1999","unstructured":"Chrobak, M., Noga, J.: LRU is better than FIFO. Algorithmica\u00a023(2), 180\u2013185 (1999)","journal-title":"Algorithmica"},{"issue":"5","key":"17_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/363095.363141","volume":"11","author":"P.J. Denning","year":"1968","unstructured":"Denning, P.J.: The working set model for program behaviour. Communications of the ACM\u00a011(5), 323\u2013333 (1968)","journal-title":"Communications of the ACM"},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TSE.1980.230464","volume":"6","author":"P.J. Denning","year":"1980","unstructured":"Denning, P.J.: Working sets past and present. IEEE Transactions on Software Engineering\u00a06(1), 64\u201384 (1980)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/1086649.1086670","volume":"36","author":"R. Dorrigiv","year":"2005","unstructured":"Dorrigiv, R., L\u00f3pez-Ortiz, A.: A survey of performance measures for on-line algorithms. SIGACT News\u00a036(3), 67\u201381 (2005)","journal-title":"SIGACT News"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"3694","DOI":"10.1016\/j.tcs.2009.04.023","volume":"410","author":"R. Dorrigiv","year":"2009","unstructured":"Dorrigiv, R., L\u00f3pez-Ortiz, A., Munro, J.I.: On the relative dominance of paging algorithms. Theoretical Computer Science\u00a0410, 3694\u20133701 (2009)","journal-title":"Theoretical Computer Science"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A.R. Karlin","year":"1988","unstructured":"Karlin, A.R., Manasse, M.S., Rudolph, L., Sleator, D.D.: Competitive snoopy caching. Algorithmica\u00a03, 79\u2013119 (1988)","journal-title":"Algorithmica"},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1137\/S0097539794268042","volume":"30","author":"A.R. Karlin","year":"2000","unstructured":"Karlin, A.R., Phillips, S.J., Raghavan, P.: Markov paging. SIAM Journal on Computing\u00a030(3), 906\u2013922 (2000)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"17_CR17","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/S0097539796299540","volume":"30","author":"E. Koutsoupias","year":"2000","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Beyond competitive analysis. SIAM Journal on Computing\u00a030(1), 300\u2013317 (2000)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"17_CR18","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"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/BF01189992","volume":"11","author":"N. Young","year":"1994","unstructured":"Young, N.: The k-server dual and loose competitiveness for paging. Algorithmica\u00a011, 525\u2013541 (1994)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,17]],"date-time":"2019-07-17T21:09:24Z","timestamp":1563397764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}