{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T07:07:13Z","timestamp":1775632033798,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"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":[[1985,6]]},"DOI":"10.1016\/0196-6774(85)90037-9","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"181-199","source":"Crossref","is-referenced-by-count":26,"title":["An analysis of optimum caching"],"prefix":"10.1016","volume":"6","author":[{"given":"Donald E","family":"Knuth","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90037-9_BIB1","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.52.0078","article-title":"A study of replacement algorithms for a virtual-storage computer","volume":"2","author":"Belady","year":"1966","journal-title":"IBM Systems J."},{"key":"10.1016\/0196-6774(85)90037-9_BIB2","first-page":"62","article-title":"Exercices de Math\u00e9matiques","author":"Cauchy","year":"1826"},{"key":"10.1016\/0196-6774(85)90037-9_BIB3","doi-asserted-by":"crossref","unstructured":"D. Fuchs and D. E. Knuth. Optimal font caching. ACM Trans. Programming Lang. Systems, in press.","DOI":"10.1145\/2363.2367"},{"key":"10.1016\/0196-6774(85)90037-9_BIB4","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0097-3165(78)90042-0","article-title":"Stirling polynomials","volume":"24","author":"Gessel","year":"1978","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0196-6774(85)90037-9_BIB5","author":"Knuth","year":"1968"},{"key":"10.1016\/0196-6774(85)90037-9_BIB6","author":"Knuth","year":"1981"},{"key":"10.1016\/0196-6774(85)90037-9_BIB7","author":"Knuth","year":"1973"},{"key":"10.1016\/0196-6774(85)90037-9_BIB8","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1109\/T-C.1975.224344","article-title":"Activity in an interleaved memory","author":"Knuth","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0196-6774(85)90037-9_BIB9","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.92.0078","article-title":"Evaluation techniques for storage hierarchies","volume":"9","author":"Mattson","year":"1970","journal-title":"IBM Systems J."},{"key":"10.1016\/0196-6774(85)90037-9_BIB10","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1214\/aop\/1176993608","article-title":"On distributions related to transitive closures of random finite mappings","volume":"11","author":"Pittel","year":"1983","journal-title":"Ann. Probab."},{"key":"10.1016\/0196-6774(85)90037-9_BIB11_1","first-page":"128","article-title":"Questions for solution, number 294","volume":"3","author":"Ramanujan","year":"1911","journal-title":"J. Indian Math. Soc."},{"key":"10.1016\/0196-6774(85)90037-9_BIB11_2","first-page":"151","article-title":"Questions for solution, number 294","volume":"4","author":"Ramanujan","year":"1912","journal-title":"J. Indian Math. Soc."},{"key":"10.1016\/0196-6774(85)90037-9_BIB12","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1109\/PGEC.1966.264467","article-title":"Statistical analysis of paged and segmented computer systems","author":"Shemer","year":"1966","journal-title":"IEEE Trans. Electronic Computers"},{"key":"10.1016\/0196-6774(85)90037-9_BIB13","series-title":"Program Behavior Models and Measurements","author":"Spirn","year":"1977"},{"key":"10.1016\/0196-6774(85)90037-9_BIB14","author":"Stanford Computer Science Department","year":"1981","journal-title":"Qualifying examination in the analysis of algorithms"},{"key":"10.1016\/0196-6774(85)90037-9_BIB15","unstructured":"R. P. Stanley, personal communication, July 1981."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900379?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900379?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:26:24Z","timestamp":1548725184000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["0196677485900379"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90037-9","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}