{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:25Z","timestamp":1759638025714},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"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,7]]},"DOI":"10.1016\/s0020-0190(97)00099-9","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"79-83","source":"Crossref","is-referenced-by-count":22,"title":["A better lower bound on the competitive ratio of the randomized 2-server problem"],"prefix":"10.1016","volume":"63","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence L.","family":"Larmore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Lund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Reingold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00099-9_BIB1","doi-asserted-by":"crossref","unstructured":"D. Achlioptas, M. Chrobak and J. Noga, Competitive analysis of randomized paging algorithms, in: Proc. 4th Ann. European Symp. on Algorithms, to appear.","DOI":"10.1007\/3-540-61680-2_72"},{"key":"10.1016\/S0020-0190(97)00099-9_BIB2","series-title":"Proc. 33rd IEEE Symp. on Foundations of Computer Science","first-page":"197","article-title":"A decomposition theorem and lower bounds for randomized server problems","author":"Blum","year":"1992"},{"key":"10.1016\/S0020-0190(97)00099-9_BIB3_1","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/0404017","article-title":"New results on server problems","volume":"4","author":"Chrobak","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(97)00099-9_BIB3_2","series-title":"Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"291","author":"Chrobak","year":"1990"},{"key":"10.1016\/S0020-0190(97)00099-9_BIB4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0404029","article-title":"A new approach to the server problem","volume":"4","author":"Chrobak","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(97)00099-9_BIB5","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1137\/0220008","article-title":"An optimal online algorithm for k servers on trees","volume":"20","author":"Chrobak","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00099-9_BIB6","series-title":"Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"301","article-title":"Randomized competitive algorithms for non-uniform problems","author":"Karlin","year":"1990"},{"key":"10.1016\/S0020-0190(97)00099-9_BIB7","unstructured":"also in: Algorithmica, to appear."},{"key":"10.1016\/S0020-0190(97)00099-9_BIB8","series-title":"Proc. 25th Symp. on Theory of Computing","first-page":"507","article-title":"On the k-server conjecture","author":"Koutsoupias","year":"1994"},{"key":"10.1016\/S0020-0190(97)00099-9_BIB9","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0020-0190(96)00010-5","article-title":"The 2-evader problem","volume":"57","author":"Koutsoupias","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00099-9_BIB10","series-title":"Proc. 5th ACM-SIAM Symp. on Discrete Algorithms","first-page":"382","article-title":"Linear programs for randomized on-line algorithms","author":"Lund","year":"1994"},{"key":"10.1016\/S0020-0190(97)00099-9_BIB11","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)00099-9_BIB12","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":"J. Algorithms"},{"key":"10.1016\/S0020-0190(97)00099-9_BIB13","series-title":"Proc. 12th ACM Symp. on Theory of Computing","article-title":"Probabilistic computations: Towards a unified measure of complexity","author":"Yao","year":"1980"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000999?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000999?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:08Z","timestamp":1556043968000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097000999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0020019097000999"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00099-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}