{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T23:08:45Z","timestamp":1761174525238},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1007\/bf01189994","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T21:02:25Z","timestamp":1108674145000},"page":"572-578","source":"Crossref","is-referenced-by-count":6,"title":["A deterministicO(k 3)-competitivek-server algorithm for the circle"],"prefix":"10.1007","volume":"11","author":[{"given":"A.","family":"Fiat","sequence":"first","affiliation":[]},{"given":"Y.","family":"Rabani","sequence":"additional","affiliation":[]},{"given":"Y.","family":"Ravid","sequence":"additional","affiliation":[]},{"given":"B.","family":"Schieber","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. Wigderson. On the Power of Randomization in Online Algorithms.Proc. 22nd Annual ACM Symp. on Theory of Computing, May 1990, pages 379?386.","DOI":"10.1145\/100216.100268"},{"key":"CR2","unstructured":"P. Berman, H. J. Karloff, and G. Tardos. A Competitive Three-Server Algorithm.Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, January 1990, pages 280?290."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"A. Borodin, N. Linial, and M. Saks. An Optimal On-Line Algorithm for Metrical Task Systems.Proc. 19th Annual ACM Symp. on Theory of Computing, May 1987, pages 373?382.","DOI":"10.1145\/28395.28435"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir. Random Walks on Weighted Graphs and Applications to On-line Algorithms.Proc. 22nd Annual ACM Symp. on Theory of Computing, May 1990, pages 369?378.","DOI":"10.1145\/100216.100266"},{"issue":"2","key":"CR5","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/0404017","volume":"4","author":"M. Chrobak","year":"1991","unstructured":"M. Chrobak, H. J. Karloff, T. Payne, and S. Vishwanathan. New results on Server Problems.SIAM J. Discrete Math.,4(2): 172?181, 1991.","journal-title":"SIAM J. Discrete Math."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1137\/0220008","volume":"20","author":"M. Chrobak","year":"1991","unstructured":"M. Chrobak and L. Larmore. An Optimal On-line Algorithm for the Server Problem on Trees.SIAM J. Comput.,20:144?148, 1991.","journal-title":"SIAM J. Comput."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"A. Fiat, Y. Rabani, and Y. Ravid. Competitive k-Server Algorithms.Proc. 31st Annual IEEE Symp. on Foundations of Computer Science, October 1990, pages 454?463.","DOI":"10.1109\/FSCS.1990.89566"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0020-0190(91)90160-J","volume":"39","author":"S. Irani","year":"1991","unstructured":"S. Irani and R. Rubinfeld. A Comptitive 2-Server Algorithm.Inform. Process. Lett.,39:85?91, 1991.","journal-title":"Inform. Process. Lett."},{"key":"CR9","unstructured":"R. M. Karp. A Randomized (n+1)k Competitive Algorithm on the Graph. Personal communication, 1989."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M. S. Manasse","year":"1990","unstructured":"M. S. Manasse, L. A. McGeoch, and D. D. Sleator. Competitive Algorithms for On-Line Problems.J. Algorithms,11:208?230, 1990.","journal-title":"J. Algorithms"},{"issue":"2","key":"CR11","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. D. Sleator","year":"1985","unstructured":"D. D. Sleator and R. E. Tarjan. Amortized Efficiency of List Update and Paging Rules.Comm. ACM,28(2):202?208, 1985.","journal-title":"Comm. ACM"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01189994.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01189994\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01189994","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:33:47Z","timestamp":1586118827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01189994"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["BF01189994"],"URL":"https:\/\/doi.org\/10.1007\/bf01189994","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}