{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T09:26:57Z","timestamp":1673170017711},"reference-count":19,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1016\/s0020-0190(97)00128-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"183-188","source":"Crossref","is-referenced-by-count":1,"title":["The working set algorithm has competitive ratio less than two"],"prefix":"10.1016","volume":"63","author":[{"given":"Kunsoo","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang Lyul","family":"Min","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yookun","family":"Cho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00128-2_BIB1","series-title":"Proc. 4th European Symp. on Algorithms","first-page":"419","article-title":"Competitive analysis of randomized paging algorithms","volume":"Vol. 1136","author":"Achlioptas","year":"1996"},{"key":"10.1016\/S0020-0190(97)00128-2_BIB2","first-page":"78","article-title":"A study of replacement algorithms for a virtual storage computer","volume":"9","author":"Belady","year":"1970","journal-title":"IBM Syst. J."},{"key":"10.1016\/S0020-0190(97)00128-2_BIB3","series-title":"Proc. 22nd ACM Symp. on Theory of Computing","first-page":"379","article-title":"On the power of randomization in online algorithms","author":"Ben-David","year":"1990"},{"key":"10.1016\/S0020-0190(97)00128-2_BIB4","series-title":"Proc. 23rd ACM Symp. on Theory of Computing","first-page":"249","article-title":"Competitive paging with locality of reference","author":"Borodin","year":"1991"},{"key":"10.1016\/S0020-0190(97)00128-2_BIB5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/363095.363141","article-title":"The working set model for program behavior","volume":"11","author":"Denning","year":"1968","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0190(97)00128-2_BIB6","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/TSE.1980.230464","article-title":"Working sets past and present","volume":"6","author":"Denning","year":"1980","journal-title":"IEEE Trans. Software Engineering"},{"key":"10.1016\/S0020-0190(97)00128-2_BIB7","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","article-title":"Competitive paging algorithms","volume":"12","author":"Fiat","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(97)00128-2_BIB8","series-title":"Proc. 31st IEEE Symp. on Foundations of Computer Science","first-page":"454","article-title":"Competitive k-server algorithms","author":"Fiat","year":"1990"},{"key":"10.1016\/S0020-0190(97)00128-2_BIB9","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1137\/0211036","article-title":"The working set size distribution for the Markov chain model of program behavior","volume":"11","author":"Hofri","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00128-2_BIB10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","article-title":"Competitive snoopy caching","volume":"3","author":"Karlin","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(97)00128-2_BIB11","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1007\/BF01189993","article-title":"Competitive randomized algorithms for non-uniform problems","volume":"11","author":"Karlin","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(97)00128-2_BIB12","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","article-title":"Competitive algorithms for server problems","volume":"11","author":"Manasse","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(97)00128-2_BIB13","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1007\/BF01759073","article-title":"A strongly competitive randomized paging algorithm","volume":"6","author":"McGeoch","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(97)00128-2_BIB14","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1145\/362375.362395","article-title":"Using page residency to select the working set parameter","volume":"16","author":"Prieve","year":"1973","journal-title":"Comm. ACM"},{"issue":"5","key":"10.1016\/S0020-0190(97)00128-2_BIB15","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/360051.360231","article-title":"VMIN \u2014 An optimal variable-space page replacement algorithm","volume":"19","author":"Prieve","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0190(97)00128-2_BIB16","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0190(97)00128-2_BIB17","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/TC.1976.1674715","article-title":"A modified working set paging algorithm","volume":"25","author":"Smith","year":"1976","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(97)00128-2_BIB18","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1145\/356887.356892","article-title":"Cache memories","volume":"14","author":"Smith","year":"1982","journal-title":"Comput. Surveys"},{"key":"10.1016\/S0020-0190(97)00128-2_BIB19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/3959.3961","article-title":"Disk cache \u2014 Miss ratio analysis and design considerations","volume":"3","author":"Smith","year":"1985","journal-title":"ACM Trans. Comput. Systems"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001282?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001282?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:26:22Z","timestamp":1556043982000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097001282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0020019097001282"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00128-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}