{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T12:17:51Z","timestamp":1699791471409},"reference-count":5,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1979,6,1]],"date-time":"1979-06-01T00:00:00Z","timestamp":297043200000},"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":[[1979,6]]},"DOI":"10.1016\/0020-0190(79)90121-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"267-271","source":"Crossref","is-referenced-by-count":4,"title":["On the space complexity of recursive algorithms"],"prefix":"10.1016","volume":"8","author":[{"given":"Eitan M.","family":"Gurari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(79)90121-2_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(79)90121-2_BIB2","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/SWAT.1973.7","article-title":"Efficient compilation of linear recursive programs","author":"Chandra","year":"1973","journal-title":"Proc. Fourteenth Annual Symposium on Switching and Automata Theory"},{"key":"10.1016\/0020-0190(79)90121-2_BIB3","article-title":"Path systems and computational complexity","author":"Gurari","year":"1978","journal-title":"University of Minnesota Computer Science Dept. Technical Report 78-3"},{"key":"10.1016\/0020-0190(79)90121-2_BIB4","first-page":"161","article-title":"Memory bounds for recognition of context-free and context-sensitive languages","author":"Lewis","year":"1965","journal-title":"Proc. Sixth Annual Symposium on Switching Circuit Theory and Logical Design"},{"key":"10.1016\/0020-0190(79)90121-2_BIB5","first-page":"135","article-title":"Space-time trade-offs for linear recursion","author":"Swamy","year":"1979","journal-title":"Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079901212?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079901212?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:29:10Z","timestamp":1555072150000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079901212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,6]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1979,6]]}},"alternative-id":["0020019079901212"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90121-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,6]]}}}