{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T03:25:29Z","timestamp":1775791529971,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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":[[1991,12]]},"DOI":"10.1016\/0196-6774(91)90041-v","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T18:03:10Z","timestamp":1099764190000},"page":"685-699","source":"Crossref","is-referenced-by-count":287,"title":["Competitive paging algorithms"],"prefix":"10.1016","volume":"12","author":[{"given":"Amos","family":"Fiat","sequence":"first","affiliation":[]},{"given":"Richard M","family":"Karp","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Luby","sequence":"additional","affiliation":[]},{"given":"Lyle A","family":"McGeoch","sequence":"additional","affiliation":[]},{"given":"Daniel D","family":"Sleator","sequence":"additional","affiliation":[]},{"given":"Neal E","family":"Young","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(91)90041-V_BIB1","series-title":"First Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"280","article-title":"A competitive 3-server algorithm","author":"Berman","year":"1990"},{"key":"10.1016\/0196-6774(91)90041-V_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"},{"key":"10.1016\/0196-6774(91)90041-V_BIB3","unstructured":"A. Borodin, M. Linial, and M. Saks, An optimal online algorithm for metrical task systems, J. ACM, to appear."},{"issue":"No. 2","key":"10.1016\/0196-6774(91)90041-V_BIB4","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/0404017","article-title":"New results on server problems","volume":"4","author":"Chrobak","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0196-6774(91)90041-V_BIB5","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1137\/0220008","article-title":"An optimal online algorithm for k servers on trees","volume":"20","author":"Chrobak","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(91)90041-V_BIB6","series-title":"Proceedings, 22nd Annual ACM Symposium on Theory of Computing","first-page":"369","article-title":"Random walks on weighted graphs and applications to on-line algorithms","author":"Coppersmith","year":"1990"},{"key":"10.1016\/0196-6774(91)90041-V_BIB7","series-title":"Proceedings, 31st Annual Symposium on Foundations of Computer Science","first-page":"454","article-title":"Competitive k-server algorithms","author":"Fiat","year":"1990"},{"key":"10.1016\/0196-6774(91)90041-V_BIB8","series-title":"First Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"301","article-title":"Competitive randomized algorithms for non-uniform problems","author":"Karlin","year":"1990"},{"issue":"No. 1","key":"10.1016\/0196-6774(91)90041-V_BIB9","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(91)90041-V_BIB10","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"},{"issue":"No. 2","key":"10.1016\/0196-6774(91)90041-V_BIB11","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\/0196-6774(91)90041-V_BIB12","doi-asserted-by":"crossref","unstructured":"L. A. McGeoch and D. D. Sleator, A strongly competitive randomized paging algorithm, Algorithmica, to appear.","DOI":"10.1007\/BF01759073"},{"key":"10.1016\/0196-6774(91)90041-V_BIB13","series-title":"Lecture notes on randomized algorithms, IBM research report","author":"Raghavan","year":"1990"},{"key":"10.1016\/0196-6774(91)90041-V_BIB14","series-title":"Automata, Languages, and Programming","first-page":"687","article-title":"Memory versus randomization in on-line algorithms","volume":"Vol. 372","author":"Raghavan","year":"1989"},{"issue":"No. 2","key":"10.1016\/0196-6774(91)90041-V_BIB15","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\/0196-6774(91)90041-V_BIB16","series-title":"Proceedings, 17th Annual Symposium on the Foundations of Computer Science","first-page":"80","article-title":"Probabilistic computations: Towards a unified measure of complexity","author":"Yao","year":"1982"},{"key":"10.1016\/0196-6774(91)90041-V_BIB17","series-title":"Second Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"241","article-title":"On-line caching as cache size varies","author":"Young","year":"1991"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190041V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190041V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T08:57:19Z","timestamp":1549097839000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749190041V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["019667749190041V"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(91)90041-v","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}