{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T17:52:23Z","timestamp":1676915543847},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6925,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0304-3975(94)90154-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"85-99","source":"Crossref","is-referenced-by-count":27,"title":["Competitive algorithms for the weighted server problem"],"prefix":"10.1016","volume":"130","author":[{"given":"Amos","family":"Fiat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moty","family":"Ricklin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90154-6_BIB1","first-page":"379","article-title":"On the power of randomization in on-line algorithms","author":"Ben-David","year":"1990","journal-title":"Proc. 22nd Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90154-6_BIB2","first-page":"373","article-title":"An optimal on-line algorithm for metrical task systems","author":"Borodin","year":"1987","journal-title":"Proc. 19th ACM STOC"},{"key":"10.1016\/0304-3975(94)90154-6_BIB3","article-title":"New results on server problems","author":"Chrobak","year":"1990","journal-title":"Proc. of 1st Ann. ACM-SIAM Symp. on Discrete Algorithms"},{"key":"10.1016\/0304-3975(94)90154-6_BIB4","unstructured":"M. Chrobak and L. Larmore, An optimal on-line algorithm for trees, Manuscript."},{"key":"10.1016\/0304-3975(94)90154-6_BIB5","first-page":"369","article-title":"Random walks on weighted graphs and applications to on-line algorithms","author":"Coppersmith","year":"1990","journal-title":"Proc. 22nd Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90154-6_BIB6","doi-asserted-by":"crossref","unstructured":"A. Fiat, D. Foster, H. Karloff, Y. Rabani, Y. Ravid and S. Viswanathan, Competitive Algorithms for Layered Graph Traversal, in: FOCS'91.","DOI":"10.1109\/SFCS.1991.185381"},{"key":"10.1016\/0304-3975(94)90154-6_BIB7","series-title":"Tech. report CMU-CS-88-196","article-title":"Competitive paging algorithms","author":"Fiat","year":"1988"},{"key":"10.1016\/0304-3975(94)90154-6_BIB8","article-title":"Competitive k-server algorithms","author":"Fiat","year":"1990","journal-title":"31st FOCS"},{"key":"10.1016\/0304-3975(94)90154-6_BIB9","article-title":"The Harmonic Online k-server Algorithm is Competitive","author":"Grove","year":"1991","journal-title":"Proc. 23rd Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90154-6_BIB10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","article-title":"Competitive snoopy caching","volume":"3","author":"Karlin","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(94)90154-6_BIB11","article-title":"Lower bounds for server problems","author":"Karloff","year":"1991","journal-title":"Proc. 23rd Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90154-6_BIB12","article-title":"Competitive alogithms for on-line problems","author":"Manasse","year":"1988","journal-title":"Proc. 20th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90154-6_BIB13","series-title":"Manuscript","article-title":"A Strongly Competitive Randomized Paging Algorithm","author":"McGeoch","year":"1989"},{"key":"10.1016\/0304-3975(94)90154-6_BIB14","series-title":"Master's Thesis","article-title":"The K-server problem with distinguishable servers","author":"Newberg","year":"1991"},{"key":"10.1016\/0304-3975(94)90154-6_BIB15","article-title":"Shortest paths without a map","author":"Papadimitriou","year":"1989","journal-title":"Proc. ICALP"},{"key":"10.1016\/0304-3975(94)90154-6_BIB16","article-title":"Memory versus randomization in on-line algorithms","author":"Raghavan","year":"1989","journal-title":"Proc. 16th ICALP"},{"key":"10.1016\/0304-3975(94)90154-6_BIB17","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":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901546?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901546?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:00Z","timestamp":1555129680000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901546"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0304397594901546"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90154-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}