{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:10:33Z","timestamp":1737349833237,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_48","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"581-592","source":"Crossref","is-referenced-by-count":6,"title":["The CNN Problem and Other k-Server Variants"],"prefix":"10.1007","author":[{"given":"Elias","family":"Koutsoupias","sequence":"first","affiliation":[]},{"given":"David Scot","family":"Taylor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations. In Proc. 26th Annual ACM Symposium on the Theory of Computing, (STOC\u2019 94), pages 593\u2013602, 1994.","DOI":"10.1145\/195058.195412"},{"key":"48_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/3-540-19487-8_20","volume-title":"1st Scandinavian Workshop on Algorithm Theory, (SWAT 88)","author":"R. A. Baeza-Yates","year":"1988","unstructured":"R. A. Baeza-Yates, J. C. Culberson, and G. J. E. Rawlins. Searching with uncertainty. In 1st Scandinavian Workshop on Algorithm Theory, (SWAT 88) pages 176\u2013189. Springer-Verlag, Lecture Notes in Computer Science 318, 1988."},{"key":"48_CR3","unstructured":"Y. Bartal and E. F. Grove. The harmonic k-server algorithm is competitive. Unpublished Manuscript, 1994."},{"key":"48_CR4","unstructured":"D. Bitton and J. Gray. Disk Shadowing. In Proceedings of the 14th International Conference on Very Large Data Bases, (VLDB\u2019 88), pages 331\u2013338, 1988."},{"issue":"4","key":"48_CR5","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1145\/3341.3349","volume":"28","author":"J. L. Bentley","year":"1985","unstructured":"J. L. Bentley and C. C. McGeoch. Amortized analyses of self-organizing sequential search heuristics. In Communications of the ACM, 28(4) pages 404\u2013411, April 1985.","journal-title":"Communications of the ACM"},{"key":"48_CR6","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis, Cambridge University Press, Cambridge Mass., 1998."},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, (STOC\u2019 87), pages 373\u2013382, 1987.","DOI":"10.1145\/28395.28435"},{"issue":"3","key":"48_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0404029","volume":"4","author":"M. Chrobak","year":"1991","unstructured":"M. Chrobak, H. Karloff, T. Payne, and S. Vishwanathan. New results on server problems. In SIAM Journal on Discrete Mathematics, 4(3):323\u2013328, May 1991.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"48_CR9","doi-asserted-by":"publisher","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 k-servers on trees. In SIAM Journal on Computing, 20(1):144\u2013148, February 1991.","journal-title":"SIAM Journal on Computing"},{"key":"48_CR10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1090\/dimacs\/007\/02","volume":"7","author":"M. Chrobak","year":"1991","unstructured":"M. Chrobak and L. Larmore. The server problem and on-line games. In On-Line Algorithms, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 7, pages 11\u201364, 1991.","journal-title":"On-Line Algorithms, DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"issue":"3","key":"48_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0404029","volume":"4","author":"M. Chrobak","year":"1991","unstructured":"M. Chrobak and L. Larmore. A new approach to the server problem. In SIAM Journal on Discrete Mathematics, 4(3):323\u2013328, 1991.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"A. Fiat, Y. Rabini, and Y. Ravid. Competitive k-server algorithms. In 31st IEEE Annual Symposium on Foundations of Computer Science, (FOCS\u2019 90), pages 454\u2013463, October 1990.","DOI":"10.1109\/FSCS.1990.89566"},{"issue":"1","key":"48_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(94)90154-6","volume":"130","author":"A. Fiat","year":"1994","unstructured":"A. Fiat and M. Ricklin. Competitive algorithms for the weighted server problem. In Theoretical Computer Science, 130(1) pages 85\u201399, August 1994.","journal-title":"Theoretical Computer Science"},{"key":"48_CR14","unstructured":"S. Gal. Search Games, Academic Press, 1980."},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"E. F. Grove. The harmonic online k-server algorithm is competitive. In Proc. 23rd Symposium on Theory of Computing, (STOC\u2019 91), pages 260\u2013266, 1991.","DOI":"10.1145\/103418.103448"},{"key":"48_CR16","unstructured":"F. Kurzweil. Small disk arrays-the emerging approach to high performance. Presentation at COMPCON 88, March 1, 1988."},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator. Competitive snoopy caching. In 27th Annual Symposium on Foundations of Computer Science, (FOCS\u2019 86), pages 244\u2013254, October 1986.","DOI":"10.1109\/SFCS.1986.14"},{"key":"48_CR18","doi-asserted-by":"crossref","unstructured":"E. Koutsoupias and C. Papadimitriou. On the k-server conjecture. In Proc. 26th Symposium on Theory of Computing, (STOC\u2019 94), pages 507\u2013511, 1994.","DOI":"10.1145\/195058.195245"},{"key":"48_CR19","doi-asserted-by":"crossref","unstructured":"M. S. Manasse, L. A. McGeoch, and D. D. Sleator. Competitive algorithms for on-line problems. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, (STOC\u2019 88), pages 322\u2013333, May 1988.","DOI":"10.1145\/62212.62243"},{"issue":"12","key":"48_CR20","first-page":"1137","volume":"13","author":"R. Muntz","year":"1998","unstructured":"R. Muntz, J. R. Santos, and S. Berson. A parallel disk storage system for real-time multimedia applications. In International Journal of Intelligent Systems, Special Issue on Multimedia Computing System, v.13, n.12, pages 1137\u201374, December 1998.","journal-title":"International Journal of Intelligent Systems, Special Issue on Multimedia Computing System"},{"key":"48_CR21","doi-asserted-by":"crossref","unstructured":"D. Patterson, G. Gibson, and R. Katz. A case for redundant arrays of inexpensive disks (RAID). In ACM SIGMOD Conference Proceedings, pages 109\u2013116, 1987.","DOI":"10.1145\/971701.50214"},{"key":"48_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/BFb0035787","volume-title":"Proc. 16th Internat. Colloq. Automata Lang. Program.","author":"C. Papadimitriou","year":"1989","unstructured":"C. Papadimitriou and M. Yannakakis. Shortest Paths Without a Map. In Proc. 16th Internat. Colloq. Automata Lang. Program., vol. 372 of Lecture Notes in Computer Science, pages 284\u2013296. Springer-Verlag, 1989."},{"issue":"1","key":"48_CR23","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"C. Papadimitriou","year":"1991","unstructured":"C. Papadimitriou and M. Yannakakis. Shortest Paths Without a Map. In Theoretical Computer Science, 84(1):127\u2013150, 1991.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"48_CR24","doi-asserted-by":"publisher","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. In Communications of the ACM, 28(2):202\u2013208, February 1985.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T02:56:07Z","timestamp":1737341767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_48","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}