{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:31:33Z","timestamp":1648611093985},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":[[1991,5]]},"DOI":"10.1016\/0020-0190(91)90095-y","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:45:40Z","timestamp":1027640740000},"page":"173-175","source":"Crossref","is-referenced-by-count":0,"title":["A note on the server problem and a benevolent adversary"],"prefix":"10.1016","volume":"38","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\/0020-0190(91)90095-Y_BIB1","unstructured":"M. Chrobak and L.L. Larmore, An optimal algorithm for the server problem on trees, SIAM J. Comput., to appear."},{"key":"10.1016\/0020-0190(91)90095-Y_BIB2","doi-asserted-by":"crossref","unstructured":"M. Chrobak and L.L. Larmore, A new approach to the server problem, SIAM J. Discrete Math., to appear.","DOI":"10.1137\/0404029"},{"key":"10.1016\/0020-0190(91)90095-Y_BIB3","first-page":"369","article-title":"Random walks on weighted graphs and applications to on-line algorithms","author":"Coppersmith","year":"1990","journal-title":"Proc. 22nd ACM STOC"},{"key":"10.1016\/0020-0190(91)90095-Y_BIB4","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 Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(91)90095-Y_BIB5","first-page":"322","article-title":"Competitive algorithms for server problems","author":"Manasse","year":"1988","journal-title":"Proc. 20th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(91)90095-Y_BIB6","series-title":"Proc. of 16th Internat. Colloq. on Automata, Languages, and Programming","first-page":"687","article-title":"Memory versus randomization in on-line algorithms","volume":"372","author":"Raghavan","year":"1989"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190095Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190095Y?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:10:43Z","timestamp":1580883043000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190095Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["002001909190095Y"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90095-y","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}