{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:26:25Z","timestamp":1725575185084},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261797"},{"type":"electronic","value":"9783540322665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11494645_33","type":"book-chapter","created":{"date-parts":[[2011,1,16]],"date-time":"2011-01-16T17:37:10Z","timestamp":1295199430000},"page":"263-274","source":"Crossref","is-referenced-by-count":11,"title":["The Flow of Data and the Complexity of Algorithms"],"prefix":"10.1007","author":[{"given":"Lars","family":"Kristiansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neil D.","family":"Jones","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Aho, A.V., Hopcroft, J.E., Jeffrey, D.: The design and analysis of computer algorithms. Addison-Wesley Publishing Co., Reading (1975)","key":"33_CR1"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S.J. Bellantoni","year":"1992","unstructured":"Bellantoni, S.J., Cook, S.: A New Recursion-Theoretic Characterization of the Polytime Functions. Computational Complexity\u00a02, 97\u2013110 (1992)","journal-title":"Computational Complexity"},{"unstructured":"Caseiro, V.H.: Equations for Defining Poly-time Functions. Ph.D. thesis, Dept. of informatics, Faculty of Mathematics and Natural Sciences University of Oslo (February 1997)","key":"33_CR3"},{"unstructured":"Frederiksen, C.C.: Automatic runtime analysis for first order functional programs. Master Thesis, Dep. of Computer Science, University of Copenhagen (2002)","key":"33_CR4"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1017\/S0956796800003889","volume":"11","author":"N.D. Jones","year":"2001","unstructured":"Jones, N.D.: The expressive power of higher-order types or, life without CONS. J. Functional Programming\u00a011, 55\u201394 (2001)","journal-title":"J. Functional Programming"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(98)00357-0","volume":"228","author":"N.D. Jones","year":"1999","unstructured":"Jones, N.D.: LOGSPACE and PTIME characterized by programming languages. Theoretical Computer Science\u00a0228, 151\u2013174 (1999)","journal-title":"Theoretical Computer Science"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-25979-4_1","volume-title":"Rewriting Techniques and Applications","author":"N.D. Jones","year":"2004","unstructured":"Jones, N.D., Bohr, N.: Termination analysis of the untyped lambda-calculus. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 1\u201323. Springer, Heidelberg (2004)"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s00037-005-0191-0","volume":"14","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L.: Neat function algebraic characterizations of LOGSPACE and LINSPACE. Computational Complexity\u00a014, 72\u201388 (2005)","journal-title":"Computational Complexity"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.tcs.2003.10.016","volume":"318","author":"L. Kristiansen","year":"2004","unstructured":"Kristiansen, L., Niggl, K.-H.: On the computational complexity of imperative programming languages. Theoretical Computer Science\u00a0318, 139\u2013161 (2004)","journal-title":"Theoretical Computer Science"},{"key":"33_CR10","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"The Garland Measure and Computational Complexity of Stack Programs","author":"L. Kristiansen","year":"2003","unstructured":"Kristiansen, L., Niggl, K.-H.: The Garland Measure and Computational Complexity of Stack Programs. Electronic Notes in Theoretical Computer Science, vol.\u00a090. Elsevier, Amsterdam (2003)"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.ipl.2003.08.010","volume":"88","author":"L. Kristiansen","year":"2003","unstructured":"Kristiansen, L., Voda, P.J.: Complexity classes and fragments of C. Information Processing Letters\u00a088, 213\u2013218 (2003)","journal-title":"Information Processing Letters"},{"unstructured":"Kristiansen, L., Voda, P.J.: Programming languages capturing complexity classes (submitted)","key":"33_CR12"},{"key":"33_CR13","series-title":"ACM Principles of Programming Languages","first-page":"81","volume-title":"The size-change principle for program termination","author":"C.S. Lee","year":"2001","unstructured":"Lee, C.S., Jones, N., Ben-Amram, A.M.: The size-change principle for program termination. ACM Principles of Programming Languages, pp. 81\u201392. ACM Press, New York (2001)"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/3-540-60178-3_84","volume-title":"Logic and Computational Complexity","author":"D. Leivant","year":"1995","unstructured":"Leivant, D.: Intrinsic theories and computational complexity. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 177\u2013194. Springer, Heidelberg (1995)"},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.apal.2004.10.011","volume":"133","author":"K.-H. Niggl","year":"2005","unstructured":"Niggl, K.-H.: Control Structures in Programs and Computational Complexity. Annals of Pure and Applied Logic\u00a0133, 247\u2013273 (2005)","journal-title":"Annals of Pure and Applied Logic"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01620765","volume":"27","author":"H. Simmons","year":"1988","unstructured":"Simmons, H.: The realm of primitive recursion. Arch. Math. Logic\u00a027, 177\u2013188 (1988)","journal-title":"Arch. Math. Logic"}],"container-title":["Lecture Notes in Computer Science","New Computational Paradigms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11494645_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:38:13Z","timestamp":1619505493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11494645_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261797","9783540322665"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11494645_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}