{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:10:14Z","timestamp":1760296214322},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1972,2,1]],"date-time":"1972-02-01T00:00:00Z","timestamp":65750400000},"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":[[1972,2]]},"DOI":"10.1016\/0020-0190(72)90009-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:32Z","timestamp":1027656692000},"page":"111-114","source":"Crossref","is-referenced-by-count":5,"title":["Expression evaluation with minimum average working storage"],"prefix":"10.1016","volume":"1","author":[{"given":"G.","family":"Chroust","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 3","key":"10.1016\/0020-0190(72)90009-9_BIB1","first-page":"149","article-title":"A Computer for Direct Execution of Algorithmic Language","volume":"7","author":"Andersor","year":"1964","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(72)90009-9_BIB2_1","series-title":"Lab. Rep. LR 25.3.077","article-title":"Scope Conserving Expression Evaluation","author":"Chroust","year":"1970"},{"key":"10.1016\/0020-0190(72)90009-9_BIB2_2","article-title":"IFIP Congress 1971","volume":"71","year":"1972"},{"issue":"No. 9","key":"10.1016\/0020-0190(72)90009-9_BIB3","first-page":"2663","article-title":"Expression Evaluation with Minimum Average Storage Demand","volume":"13","author":"Chroust","year":"1971","journal-title":"IBM Techn. Disclosure Bull."},{"issue":"No. 1","key":"10.1016\/0020-0190(72)90009-9_BIB4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1093\/comjnl\/6.1.67","article-title":"Note on Coding Reverse Polish Expressions for Single Address Computers with one Accumulator","volume":"6","author":"Colin","year":"1963","journal-title":"Comp. J."},{"issue":"No. 8","key":"10.1016\/0020-0190(72)90009-9_BIB5","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1145\/363534.363549","article-title":"On Compiling Algorithms for Arithmetic Expressions","volume":"10","author":"Nakata","year":"1967","journal-title":"Comm. ACM"},{"issue":"No. 2","key":"10.1016\/0020-0190(72)90009-9_BIB6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/362848.362859","article-title":"On Arithmetic Expressions and Trees","volume":"12","author":"Redziejowski","year":"1969","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019072900099?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019072900099?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:58:19Z","timestamp":1555088299000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019072900099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,2]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1972,2]]}},"alternative-id":["0020019072900099"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(72)90009-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1972,2]]}}}