{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:30:42Z","timestamp":1720625442954},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T00:00:00Z","timestamp":1376697600000},"content-version":"vor","delay-in-days":3577,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1016\/s1571-0661(03)00003-3","type":"journal-article","created":{"date-parts":[[2003,12,2]],"date-time":"2003-12-02T12:09:41Z","timestamp":1070366981000},"page":"15-35","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["The Garland Measure and Computational Complexity of Stack Programs"],"prefix":"10.1016","volume":"90","author":[{"given":"L.","family":"Kristiansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.-H.","family":"Niggl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(03)00003-3_BIB001","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/malq.19650110310","article-title":"Iteration of primitive recursion","volume":"11","author":"Axt","year":"1965","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/S1571-0661(03)00003-3_BIB002","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01201998","article-title":"A New Recursion-Theoretic Characterization of the Polytime Functions","volume":"2","author":"Bellantoni","year":"1992","journal-title":"Computational Complexity"},{"issue":"2","key":"10.1016\/S1571-0661(03)00003-3_BIB003","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S009753979528175X","article-title":"Ranking primitive recursions: The low Grzegorczyk classes revisited","volume":"29","author":"Bellantoni","year":"2000","journal-title":"SIAM J. of Comput."},{"key":"10.1016\/S1571-0661(03)00003-3_BIB004","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0168-0072(00)00006-3","article-title":"Higher type recursion, ramification and polynomial time","volume":"104","author":"Bellantoni","year":"2000","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S1571-0661(03)00003-3_BIB005","unstructured":"Fredriksen, C.C., \u201cAutomatic Runtime Analysis for First Order Functional Programs.\u201d Master thesis. DIKU, University of Copenhagen"},{"key":"10.1016\/S1571-0661(03)00003-3_BIB006","first-page":"1","article-title":"Some classes of recursive functions","volume":"IV","author":"Grzegorczyk","year":"1953","journal-title":"Rozprawy Matematyczne, Warszawa"},{"key":"10.1016\/S1571-0661(03)00003-3_BIB007","unstructured":"Heinermann, W., Untersuchungen \u00fcber die Rekursionszahlen rekursiver Funktionen, Dissertation, M\u00fcnster (1961)"},{"key":"10.1016\/S1571-0661(03)00003-3_BIB008","unstructured":"Kristiansen, L., Niggl, K.-H., On the computational complexity of imperative programming languages, Theoretical Computer Science (to appear). Available at http:\/\/eiche.theoinf.tu-ilmenau.de\/~niggl"},{"key":"10.1016\/S1571-0661(03)00003-3_BIB009","series-title":"Proc. ACM Nat. Conf.","first-page":"465","article-title":"The complexity of loop programs","author":"Meyer","year":"1967"},{"key":"10.1016\/S1571-0661(03)00003-3_BIB010","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s001530050163","article-title":"The \u03bc-measure as a tool for classifying computational complexity","volume":"39","author":"Niggl","year":"2000","journal-title":"Archive for Mathematical Logic"},{"key":"10.1016\/S1571-0661(03)00003-3_BIB011","unstructured":"Niggl, K.-H., Control Structures in Programs and Computational Complexity, ICC' 02, Copenhagen, http:\/\/eiche.theoinf.tu-ilmenau.de\/~niggl"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066103000033?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066103000033?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T16:54:48Z","timestamp":1550336088000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066103000033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":11,"alternative-id":["S1571066103000033"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(03)00003-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}