{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T02:53:56Z","timestamp":1721271236484},"reference-count":10,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"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":[[2002,12]]},"DOI":"10.1016\/s0020-0190(02)00287-9","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T19:38:56Z","timestamp":1034019536000},"page":"271-276","source":"Crossref","is-referenced-by-count":10,"title":["More on random walks, electrical networks, and the harmonic -server algorithm"],"prefix":"10.1016","volume":"84","author":[{"given":"Yair","family":"Bartal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Chrobak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Noga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prabhakar","family":"Raghavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0020-0190(02)00287-9_BIB001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/331605.331606","article-title":"The harmonic k-server algorithm is competitive","volume":"47","author":"Bartal","year":"2000","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(02)00287-9_BIB002","series-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"1998"},{"key":"10.1016\/S0020-0190(02)00287-9_BIB003","series-title":"Proc. 21st Symp. Theory of Computing","first-page":"574","article-title":"The electrical resistance of a graph captures its commute and cover times","author":"Chandra","year":"1989"},{"key":"10.1016\/S0020-0190(02)00287-9_BIB004","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":"98","author":"Chrobak","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(02)00287-9_BIB005","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0020-0190(00)00070-3","article-title":"A simple analysis of the harmonic algorithm for two servers","volume":"75","author":"Chrobak","year":"2000","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00287-9_BIB006","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1145\/174130.174131","article-title":"Random walks on weighted graphs and applications to on-line algorithms","volume":"40","author":"Coppersmith","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(02)00287-9_BIB007","series-title":"Random Walks and Electrical Networks","author":"Doyle","year":"1984"},{"key":"10.1016\/S0020-0190(02)00287-9_BIB008","first-page":"143","article-title":"Solution of passive electrical networks by means of mathematical trees","volume":"100","author":"Percival","year":"1953","journal-title":"J. Inst. Elect. Engrs."},{"key":"10.1016\/S0020-0190(02)00287-9_BIB009","series-title":"Proc. 16th International Colloquium on Automata, Languages, and Programming","first-page":"687","article-title":"Memory versus randomization in online algorithms","volume":"372","author":"Raghavan","year":"1989"},{"key":"10.1016\/S0020-0190(02)00287-9_BIB010","series-title":"Linear Graphs and Electrical Networks","author":"Seshu","year":"1961"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002879?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002879?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:50:29Z","timestamp":1555199429000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002002879"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S0020019002002879"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00287-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}