{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:45Z","timestamp":1759638225780},"reference-count":9,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":[[1996,3]]},"DOI":"10.1016\/0020-0190(96)00010-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:21:21Z","timestamp":1027621281000},"page":"249-252","source":"Crossref","is-referenced-by-count":33,"title":["The 2-evader problem"],"prefix":"10.1016","volume":"57","author":[{"given":"Elias","family":"Koutsoupias","sequence":"first","affiliation":[]},{"given":"Christos","family":"Papadimitriou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00010-5_BIB1","series-title":"Proc. 33rd IEEE Symp. on Foundations of Computer Science","first-page":"197","article-title":"A decomposition theorem and lower bounds for randomized server problems","author":"Blum","year":"1992"},{"key":"10.1016\/0020-0190(96)00010-5_BIB2","doi-asserted-by":"crossref","unstructured":"M. Chrobak and L.L. Larmore, An optimal online algorithm for k servers on trees, SIAM J. Comput. 20 (19910 144\u2013148.","DOI":"10.1137\/0220008"},{"key":"10.1016\/0020-0190(96)00010-5_BIB3","first-page":"11","article-title":"The server problem and online games","volume":"Vol. 7","author":"Chrobak","year":"1992"},{"key":"10.1016\/0020-0190(96)00010-5_BIB4","article-title":"On-line algorithms and the k-server conjecture","author":"Koutsoupias","year":"1994"},{"key":"10.1016\/0020-0190(96)00010-5_BIB5_1","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1145\/210118.210128","article-title":"On the k-server conjecture","volume":"45","author":"Koutsoupias","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(96)00010-5_BIB5_2","series-title":"Proc. 25th Ann. ACM Symp. on Theory of Computing","first-page":"507","author":"Koutsoupias","year":"1994"},{"key":"10.1016\/0020-0190(96)00010-5_BIB6_1","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","article-title":"Competitive algorithms for server problems","volume":"11","author":"Manasse","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(96)00010-5_BIB6_2","series-title":"Proc. 20th Ann. ACM Symp. on Theory of Computing","first-page":"322","author":"Manasse","year":"1988"},{"key":"10.1016\/0020-0190(96)00010-5_BIB7","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000105?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000105?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T20:35:00Z","timestamp":1579034100000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0020019096000105"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00010-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}