{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:15Z","timestamp":1759638015752,"version":"3.41.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,9,2]],"date-time":"2016-09-02T00:00:00Z","timestamp":1472774400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2016,9,2]],"date-time":"2016-09-02T00:00:00Z","timestamp":1472774400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["639.022.211"],"award-info":[{"award-number":["639.022.211"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["consolidator grant 617951"],"award-info":[{"award-number":["consolidator grant 617951"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["grant DEC-2013\/09\/B\/ST6\/01538"],"award-info":[{"award-number":["grant DEC-2013\/09\/B\/ST6\/01538"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["grants CCF-1115575, CNS-1253218, CCF-1421508"],"award-info":[{"award-number":["grants CCF-1115575, CNS-1253218, CCF-1421508"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s00224-016-9703-3","type":"journal-article","created":{"date-parts":[[2016,9,2]],"date-time":"2016-09-02T05:45:49Z","timestamp":1472795149000},"page":"349-365","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Tight Bounds for Double Coverage Against Weak Adversaries"],"prefix":"10.1007","volume":"62","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Eli\u00e1\u0161","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Je\u017c","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grigorios","family":"Koumoutsos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,2]]},"reference":[{"issue":"2\u20133","key":"9703_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.tcs.2004.06.001","volume":"324","author":"Y Bartal","year":"2004","unstructured":"Bartal, Y., Koutsoupias, E.: On the competitive ratio of the work function algorithm for the k-server problem. Theor. Comput. Sci 324(2\u20133), 337\u2013345 (2004)","journal-title":"Theor. Comput. Sci"},{"key":"9703_CR2","unstructured":"Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press (1998)"},{"issue":"2","key":"9703_CR3","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/0404017","volume":"4","author":"M Chrobak","year":"1991","unstructured":"Chrobak, M., Karloff, H.J., Payne, T.H., Vishwanathan, S.: New results on server problems. SIAM J. Discrete Math. 4(2), 172\u2013181 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"9703_CR4","doi-asserted-by":"publisher","unstructured":"Chrobak, M., Larmore, L.L.: An optimal on-line algorithm for k-servers on trees. SIAM J. Comput. 20(1), 144\u2013148 (1991). doi: 10.1137\/0220008","DOI":"10.1137\/0220008"},{"key":"9703_CR5","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Larmore, L.L.: The server problem and on-line games. In: On-line Algorithms, volume 7 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 11\u201364. AMS\/ACM (1992)","DOI":"10.1090\/dimacs\/007\/02"},{"key":"9703_CR6","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E.: Weak adversaries for the k-server problem. In: Proc. of the 40th Symp. on Foundations of Computer Science (FOCS), pp. 444\u2013449 (1999)","DOI":"10.1109\/SFFCS.1999.814616"},{"issue":"5","key":"9703_CR7","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1145\/210118.210128","volume":"42","author":"E Koutsoupias","year":"1995","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: On the k-server conjecture. J. ACM 42(5), 971\u2013983 (1995)","journal-title":"J. ACM"},{"issue":"2","key":"9703_CR8","first-page":"208","volume":"11","author":"MS Manasse","year":"1990","unstructured":"Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for server problems. J. ACM 11(2), 208\u2013230 (1990)","journal-title":"J. ACM"},{"key":"9703_CR9","doi-asserted-by":"publisher","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985). doi: 10.1145\/2786.2793","DOI":"10.1145\/2786.2793"},{"key":"9703_CR10","doi-asserted-by":"publisher","unstructured":"Young, N.E.: The k-server dual and loose competitiveness for paging. Algorithmica 11(6), 525\u2013541 (1994). doi: 10.1007\/BF01189992","DOI":"10.1007\/BF01189992"},{"key":"9703_CR11","doi-asserted-by":"publisher","unstructured":"Young, N.E.: On-line file caching. Algorithmica 33(3), 371\u2013383 (2002). Journal version of [1998] doi: 10.1007\/s00453-001-0124-5","DOI":"10.1007\/s00453-001-0124-5"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-016-9703-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9703-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9703-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9703-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:04:47Z","timestamp":1749571487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-016-9703-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,2]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["9703"],"URL":"https:\/\/doi.org\/10.1007\/s00224-016-9703-3","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2016,9,2]]},"assertion":[{"value":"2 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}