{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:32Z","timestamp":1759626632904,"version":"build-2065373602"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5617,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0304-3975(97)00006-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"163-182","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":22,"title":["Randomized algorithms for metrical task systems"],"prefix":"10.1016","volume":"194","author":[{"given":"Sandy","family":"Irani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steve","family":"Seiden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00006-6_BIB1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01294260","article-title":"On the power of randomization in on-line algorithms","volume":"11","author":"Ben-David","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(97)00006-6_BIB2","series-title":"Proc. 33rd IEEE Symp. on Foundations of Computer Science (FOCS)","first-page":"197","article-title":"A decomposition theorem and bounds for randomized server problems","author":"Blum","year":"1992"},{"key":"10.1016\/S0304-3975(97)00006-6_BIB3","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1145\/146585.146588","article-title":"An optimal on-line algorithm for metrical task systems","volume":"39","author":"Borodin","year":"1992","journal-title":"J. ACM"},{"article-title":"Traversing layered graphs using the work function algorithm","year":"1993","author":"Burley","key":"10.1016\/S0304-3975(97)00006-6_BIB4"},{"key":"10.1016\/S0304-3975(97)00006-6_BIB5","series-title":"Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA)","first-page":"420","article-title":"On algorithm design for metrical task systems","author":"Burley","year":"1995"},{"key":"10.1016\/S0304-3975(97)00006-6_BIB6","series-title":"Proc. DIMACS Workshop on On-line Algorithms","first-page":"11","article-title":"Server problems and on-line games","author":"Chrobak","year":"1991"},{"key":"10.1016\/S0304-3975(97)00006-6_BIB7","unstructured":"M. Chrobak and J. Noga, unpublished manuscript."},{"key":"10.1016\/S0304-3975(97)00006-6_BIB8","series-title":"Proc. 4th Workshop on Algorithms and Data Structures","first-page":"159","article-title":"Randomized algorithms for metrical task systems","volume":"Vol. 955","author":"Irani","year":"1995"},{"key":"10.1016\/S0304-3975(97)00006-6_BIB9","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1007\/BF01189993","article-title":"Competitive randomized algorithms for non-uniform problems","volume":"11","author":"Karlin","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(97)00006-6_BIB10","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\/S0304-3975(97)00006-6_BIB11","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"},{"key":"10.1016\/S0304-3975(97)00006-6_BIB12","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","article-title":"Self adjusting binary search trees","volume":"32","author":"Sleator","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00006-6_BIB13","series-title":"Proc. DIMACS Workshop on On-line Algorithms","article-title":"Randomized algorithms for multiprocessor page migration","author":"Westbrook","year":"1992"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000066?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000066?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:45:35Z","timestamp":1759625135000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0304397597000066"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00006-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1998,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Randomized algorithms for metrical task systems","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(97)00006-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}