{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:45:30Z","timestamp":1725551130284},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540006237"},{"type":"electronic","value":"9783540364948"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36494-3_23","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:12:04Z","timestamp":1269897124000},"page":"247-259","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of the Harmonic Algorithm for Three Servers"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Sgall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,17]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0020-0190(02)00287-9","volume":"84","author":"Y. Bartal","year":"2002","unstructured":"Y. Bartal, M. Chrobak, J. Noga, and P. Raghavan. More on random walks, electrical networks, and the harmonic k-server algorithm. Information Processing Letters, 84:271\u2013276, 2002.","journal-title":"Information Processing Letters"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/331605.331606","volume":"47","author":"Y. Bartal","year":"2000","unstructured":"Y. Bartal and E. Grove. The harmonic k-server algorithm is competitive. Journal of the ACM, 47(1):1\u201315, 2000.","journal-title":"Journal of the ACM"},{"key":"23_CR3","unstructured":"P. Berman, H. Karlo., and G. Tardos. A competitive algorithm for three servers. In Proc. 1st Symp. on Discrete Algorithms, pages 280\u2013290, 1990."},{"key":"23_CR4","unstructured":"A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01270385","volume":"6","author":"A. K. Chandra","year":"1997","unstructured":"A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky, and P. Tiwari. The electrical resistance of a graph captures its commute and cover times. Computational Complexity, 6:312\u2013340, 1997.","journal-title":"Computational Complexity"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(92)90007-3","volume":"98","author":"M. Chrobak","year":"1992","unstructured":"M. Chrobak and L. L. Larmore. HARMONIC is three-competitive for two servers. Theoretical Computer Science, 98:339\u2013346, 1992.","journal-title":"Theoretical Computer Science"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"M. Chrobak and L. L. Larmore. Metrical task systems, the server problem, and the work function algorithm. In Online Algorithms: State of the Art, pages 74\u201394. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0029565"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0020-0190(00)00070-3","volume":"75","author":"M. Chrobak","year":"2000","unstructured":"M. Chrobak and J. Sgall. A simple analysis of the harmonic algorithm for two servers. Information Processing Letters, 75:75\u201377, 2000.","journal-title":"Information Processing Letters"},{"key":"23_CR9","unstructured":"M. Chrobak and J. Sgall. Analysis of the harmonic algorithm for three servers. Technical Report ITI Series 2002-102, Charles University, Prague, 2002. http:\/\/iti.mff.cuni.cz\/series\/index.html"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1145\/174130.174131","volume":"40","author":"D. Coppersmith","year":"1993","unstructured":"D. Coppersmith, P. G. Doyle, P. Raghavan, and M. Snir. Random walks on weighted graphs and applications to on-line algorithms. Journal of the ACM, 40:421\u2013453, 1993.","journal-title":"Journal of the ACM"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"P. G. Doyle and J. L. Snell. Random Walks and Electrical Networks. Mathematical Association of America, 1984.","DOI":"10.5948\/UPO9781614440222"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1145\/210118.210128","volume":"42","author":"E. Koutsoupias","year":"1995","unstructured":"E. Koutsoupias and C. Papadimitriou. On the k-server conjecture. Journal of the ACM, 42:971\u2013983, 1995.","journal-title":"Journal of the ACM"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M. Manasse","year":"1990","unstructured":"M. Manasse, L. A. McGeoch, and D. Sleator. Competitive algorithms for server problems. Journal of Algorithms, 11:208\u2013230, 1990.","journal-title":"Journal of Algorithms"},{"key":"23_CR14","first-page":"143","volume":"100","author":"W. Percival","year":"1953","unstructured":"W. Percival. Solution of passive electrical networks by means of mathematical trees. J. Inst. Elect. Engrs., 100:143\u2013150, 1953.","journal-title":"J. Inst. Elect. Engrs."},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"P. Raghavan and M. Snir. Memory versus randomization in on-line algorithms. IBM Journal on Research and Development, 38, 1994.","DOI":"10.1147\/rd.386.0683"},{"key":"23_CR16","unstructured":"S. Seshu and M. B. Reed. Linear Graphs and Electrical Networks. Addison-Wesley, 1961."}],"container-title":["Lecture Notes in Computer Science","STACS 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36494-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,3]],"date-time":"2020-06-03T10:21:32Z","timestamp":1591179692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36494-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006237","9783540364948"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-36494-3_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}