{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T18:40:20Z","timestamp":1772822420292,"version":"3.50.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1-6","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf01759073","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T10:43:56Z","timestamp":1118918636000},"page":"816-825","source":"Crossref","is-referenced-by-count":159,"title":["A strongly competitive randomized paging algorithm"],"prefix":"10.1007","volume":"6","author":[{"given":"Lyle A.","family":"McGeoch","sequence":"first","affiliation":[]},{"given":"Daniel D.","family":"Sleator","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01759073_CR1","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L. A. Belady","year":"1966","unstructured":"Belady, L. A. A study of replacement algorithms for virtual storage computers.IBM Systems Journal,5:78\u2013101, 1966.","journal-title":"IBM Systems Journal"},{"key":"BF01759073_CR2","doi-asserted-by":"crossref","unstructured":"Fiat, A., Karp, R. M., Luby, M., McGeoch, L. A., Sleator, D. D., and Young, N. E. Competitive paging algorithms.Journal of Algorithms, to appear, 1991.","DOI":"10.1016\/0196-6774(91)90041-V"},{"key":"BF01759073_CR3","doi-asserted-by":"crossref","unstructured":"Manasse, M. S., McGeoch, L. A., and Sleator, D. D. Competitive algorithms for on-line problems. InProceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, 1988, pages 322\u2013333.","DOI":"10.1145\/62212.62243"},{"issue":"2","key":"BF01759073_CR4","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M. S. Manasse","year":"1990","unstructured":"Manasse, M. S., McGeoch, L. A., and Sleator, D. D. Competitive algorithms for server problems.Journal of Algorithms, 11(2):208\u2013230, June 1990.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"BF01759073_CR5","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. D. Sleator","year":"1985","unstructured":"Sleator, D. D., and Tarjan, R. E. Amortized efficiency of list update and paging rules.Communications of the ACM, 28(2):202\u2013208, February 1985.","journal-title":"Communications of the ACM"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759073.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01759073\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759073","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T16:25:44Z","timestamp":1557332744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01759073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":5,"journal-issue":{"issue":"1-6","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01759073"],"URL":"https:\/\/doi.org\/10.1007\/bf01759073","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}