{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T03:16:57Z","timestamp":1673407017464},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7747,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1016\/0304-3975(92)90007-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"339-346","source":"Crossref","is-referenced-by-count":11,"title":["HARMONIC is 3-competitive for two servers"],"prefix":"10.1016","volume":"98","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"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90007-3_BIB1","first-page":"291","article-title":"A competitive algorithm for three servers","author":"Berman","year":"1990","journal-title":"Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms"},{"key":"10.1016\/0304-3975(92)90007-3_BIB2","doi-asserted-by":"crossref","unstructured":"M. Chrobak and L. Larmore, A new approach to the server problem, SIAM J. Comput., to appear. pear.","DOI":"10.1137\/0404029"},{"key":"10.1016\/0304-3975(92)90007-3_BIB3","doi-asserted-by":"crossref","unstructured":"M. Chrobak and L. Larmore, Fast algorithms for two servers, J. Algorithms, to appear.","DOI":"10.1007\/BFb0029609"},{"key":"10.1016\/0304-3975(92)90007-3_BIB4","first-page":"369","article-title":"Random walks on weighted graphs and applications to on-line algorithms","author":"Coppersmith","year":"1990","journal-title":"Proc. 22nd Annual ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(92)90007-3_BIB5","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1109\/FSCS.1990.89566","article-title":"Competitive k-server algorithms","author":"Fiat","year":"1990","journal-title":"Proc. 31st Annual Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(92)90007-3_BIB6","unstructured":"E. Grove, The harmonic on-line k-server algorithm is competitive, a manuscript."},{"key":"10.1016\/0304-3975(92)90007-3_BIB7_1","unstructured":"M. Manasse, L>A> McGeoch and D. Sleator, Competive algorithms for server problems, Tech. Report CMU-CS-88-197, Carnegie-Mellon University"},{"key":"10.1016\/0304-3975(92)90007-3_BIB7_2","first-page":"322","article-title":"Competitive algorithms for server problems","author":"Manasse","year":"1988","journal-title":"Proc. 20th ACM STOC"},{"key":"10.1016\/0304-3975(92)90007-3_BIB8","first-page":"687","article-title":"Memory versus randomization in on-line algorithms","volume":"Vol. 372","author":"Raghavan","year":"1988"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592900073?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592900073?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:21:35Z","timestamp":1580883695000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592900073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["0304397592900073"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90007-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}