{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T03:16:49Z","timestamp":1673407009336},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":[[2000,7]]},"DOI":"10.1016\/s0020-0190(00)00070-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:37:09Z","timestamp":1027615029000},"page":"75-77","source":"Crossref","is-referenced-by-count":5,"title":["A simple analysis of the harmonic algorithm for two servers"],"prefix":"10.1016","volume":"75","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u0131\u0301","family":"Sgall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00070-3_ID008","doi-asserted-by":"crossref","unstructured":"Y. Bartal, E. Grove, The harmonic k -server algorithm is competitive, J. ACM, to appear","DOI":"10.1145\/331605.331606"},{"key":"10.1016\/S0020-0190(00)00070-3_ID009","series-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"1998"},{"key":"10.1016\/S0020-0190(00)00070-3_ID010","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(92)90007-3","article-title":"HARMONIC is three-competitive for two servers","volume":"Vol. 98","author":"Chrobak","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(00)00070-3_ID011","series-title":"Online Algorithms: State of the Art","first-page":"74","article-title":"Metrical task systems, the server problem, and the work function algorithm","author":"Chrobak","year":"1998"},{"key":"10.1016\/S0020-0190(00)00070-3_ID012","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1145\/210118.210128","article-title":"On the k -server conjecture","volume":"Vol. 42","author":"Koutsoupias","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(00)00070-3_ID013","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","article-title":"Competitive algorithms for server problems","volume":"Vol. 11","author":"Manasse","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(00)00070-3_ID014","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1147\/rd.386.0683","article-title":"Memory versus randomization in on-line algorithms","volume":"Vol. 38","author":"Raghavan","year":"1994","journal-title":"IBM J. Res. Development"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000703?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000703?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T03:22:36Z","timestamp":1555816956000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000000703"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0020019000000703"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00070-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}