{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T04:13:48Z","timestamp":1780460028797,"version":"3.54.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0196-6774(90)90003-w","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"208-230","source":"Crossref","is-referenced-by-count":286,"title":["Competitive algorithms for server problems"],"prefix":"10.1016","volume":"11","author":[{"given":"Mark S","family":"Manasse","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lyle A","family":"McGeoch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel D","family":"Sleator","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(90)90003-W_BIB1","unstructured":"D. Black and D. D. Sleator, Algorithms for the 1-server problem with excursions, in preparation."},{"key":"10.1016\/0196-6774(90)90003-W_BIB2","series-title":"Proceedings, 19th Annual ACM Symposium on Theory of Computing","first-page":"373","article-title":"An optimal online algorithm for metrical task systems","author":"Borodin","year":"1987"},{"issue":"No. 4","key":"10.1016\/0196-6774(90)90003-W_BIB3","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1287\/moor.10.4.585","article-title":"Sequencing problems in two-server systems","volume":"10","author":"Calderbank","year":"1985","journal-title":"Math. Oper. Res."},{"issue":"No. 1","key":"10.1016\/0196-6774(90)90003-W_BIB4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1080\/15326348508807002","article-title":"Sequencing two servers on a sphere","volume":"1","author":"Calderbank","year":"1985","journal-title":"Commun. Statist.-Stochastic Models"},{"key":"10.1016\/0196-6774(90)90003-W_BIB5","article-title":"Competitive Paging Algorithms","author":"Fiat","year":"1988","journal-title":"Carnegie Mellon University Computer Science technical report CMU-CS-88\u2013196"},{"issue":"No. 1","key":"10.1016\/0196-6774(90)90003-W_BIB6","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\/0196-6774(90)90003-W_BIB7","series-title":"Proceedings, 20th Annual ACM Symposium on Theory of Computing","first-page":"322","article-title":"Competitive algorithms for on-line problems","author":"Manasse","year":"1988"},{"key":"10.1016\/0196-6774(90)90003-W_BIB8","unstructured":"L. A. McGeoch, D. D. Sleator, and C. Tomasi, Decision procedures for competitive algorithms, in preparation."},{"key":"10.1016\/0196-6774(90)90003-W_BIB9","unstructured":"L. A. McGeoch and D. D. Sleator, \u201cA Strongly Competitive Randomized Paging Algorithm,\u201d Carnegie Mellon University Computer Science technical report CMU-CS-89\u2013122, 1989; Algorithmica, in press."},{"key":"10.1016\/0196-6774(90)90003-W_BIB10","series-title":"Automata, Languages, and Programming","first-page":"687","article-title":"Memory versus randomization in on-line algorithms","volume":"Vol. 372","author":"Raghavan","year":"1988"},{"issue":"No. 2","key":"10.1016\/0196-6774(90)90003-W_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"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749090003W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749090003W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:54:08Z","timestamp":1548744848000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749090003W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["019667749090003W"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(90)90003-w","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}