{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T18:31:56Z","timestamp":1648665116240},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,10,1]],"date-time":"1987-10-01T00:00:00Z","timestamp":560044800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1987,10]]},"DOI":"10.1016\/0020-0190(87)90046-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"105-110","source":"Crossref","is-referenced-by-count":0,"title":["On the structural locality of reference in LISP list access streams"],"prefix":"10.1016","volume":"26","author":[{"given":"Matthew J.","family":"Thazhuthaveetil","sequence":"first","affiliation":[]},{"given":"Andrew R.","family":"Pleszkun","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(87)90046-9_BIB1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/TSE.1979.226495","article-title":"Measurements of dynamic list structure in LISP","volume":"5","author":"Clark","year":"1979","journal-title":"IEEE Trans. Software Engineering"},{"issue":"2","key":"10.1016\/0020-0190(87)90046-9_BIB2","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/359423.359427","article-title":"An empirical study of list structure in LISP","volume":"20","author":"Clark","year":"1977","journal-title":"Comm. ACM"},{"issue":"9","key":"10.1016\/0020-0190(87)90046-9_BIB3","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.92.0078","article-title":"Evaluation techniques for storage hierarchies","volume":"2","author":"Mattson","year":"1970","journal-title":"IBM Systems J."},{"issue":"4","key":"10.1016\/0020-0190(87)90046-9_BIB4","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/367177.367199","article-title":"Recursive functions of symbolic expressions and their computation by machine: Part 1","volume":"3","author":"McCarthy","year":"1960","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(87)90046-9_BIB5","series-title":"Proc. 12th Ann. Internat. Symp. on Computer Architecture","first-page":"64","article-title":"Cache evaluation and the impact of workload choice","author":"Smith","year":"1985"},{"key":"10.1016\/0020-0190(87)90046-9_BIB6","series-title":"Ph.D. Dissertation","article-title":"A Structured Memory Access Architecture for LISP","author":"Thazhuthaveetil","year":"1986"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087900469?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087900469?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:59:02Z","timestamp":1555088342000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087900469"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,10]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,10]]}},"alternative-id":["0020019087900469"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90046-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,10]]}}}