{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:21:36Z","timestamp":1725891696504},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153303"},{"type":"electronic","value":"9783642153310"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15331-0_7","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T09:11:25Z","timestamp":1283850685000},"page":"100-113","source":"Crossref","is-referenced-by-count":5,"title":["Derivational Complexity Is an Invariant Cost Model"],"prefix":"10.1007","author":[{"given":"Ugo","family":"Dal Lago","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simone","family":"Martini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ic.2004.05.001","volume":"193","author":"A. Asperti","year":"2004","unstructured":"Asperti, A., Coppola, P., Martini, S.: Optimalduplication is not elementary recursive. Inf. Comput.\u00a0193(1), 21\u201356 (2004)","journal-title":"Inf. Comput."},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1006\/inco.2001.2869","volume":"170","author":"A. Asperti","year":"2001","unstructured":"Asperti, A., Mairson, H.G.: Parallel beta reduction is not elementary recursive. Inf. Comput.\u00a0170(1), 49\u201380 (2001)","journal-title":"Inf. Comput."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-78969-7_11","volume-title":"Functional and Logic Programming","author":"M. Avanzini","year":"2008","unstructured":"Avanzini, M., Moser, G.: Complexity analysis by rewriting. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol.\u00a04989, pp. 130\u2013146. Springer, Heidelberg (2008)"},{"key":"7_CR4","first-page":"141","volume-title":"Parallel Languages on PARLE: Parallel Architectures and Languages Europe","author":"H. Barendregt","year":"1986","unstructured":"Barendregt, H., Eekelen, M., Glauert, J., Kennaway, J., Plasmeijer, M., Sleep, M.: Term graph rewriting. In: de Bakker, J., Nijman, A., Treleaven, P. (eds.) Parallel Languages on PARLE: Parallel Architectures and Languages Europe, vol.\u00a0II, pp. 141\u2013158. Springer, Heidelberg (1986)"},{"key":"7_CR5","first-page":"712","volume-title":"Term Rewriting Systems, ch. 13","author":"E. Barendsen","year":"2003","unstructured":"Barendsen, E.: Term graph rewriting. In: Bezem, T.M., Klop, J.W., de Vrijer, R. (eds.) Term Rewriting Systems, ch. 13, pp. 712\u2013743. Cambridge Univ. Press, Cambridge (2003)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-45575-2_46","volume-title":"Perspectives of System Informatics","author":"G. Bonfante","year":"2001","unstructured":"Bonfante, G., Marion, J.-Y., Moyen, J.-Y.: On lexicographic termination ordering with space bound certifications. In: Bj\u00f8rner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol.\u00a02244, pp. 482\u2013493. Springer, Heidelberg (2001)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-02930-1_14","volume-title":"Automata, Languages and Programming","author":"U. Lago Dal","year":"2009","unstructured":"Dal Lago, U., Martini, S.: On constructor rewriting systems and the lambda calculus. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 163\u2013174. Springer, Heidelberg (2009)"},{"key":"7_CR8","first-page":"71","volume":"35","author":"Y. Gurevich","year":"1988","unstructured":"Gurevich, Y.: On Kolmogorov machines and related issues. Bulletin of the European Association for Theoretical Computer Science\u00a035, 71\u201382 (1988)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"7_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-71070-7_32","volume-title":"Automated Reasoning","author":"N. Hirokawa","year":"2008","unstructured":"Hirokawa, N., Moser, G.: Automated complexity analysis based on the dependency pair method. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol.\u00a05195, pp. 364\u2013379. Springer, Heidelberg (2008)"},{"key":"7_CR10","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2003.001.0001","volume-title":"Computability and Complexity from a Programming Perspective","author":"N.D. Jones","year":"1997","unstructured":"Jones, N.D.: Computability and Complexity from a Programming Perspective. MIT Press, Cambridge (1997)"},{"key":"7_CR11","first-page":"462","volume-title":"The Art of Computer Programming","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: The Art of Computer Programming, vol.\u00a01, pp. 462\u2013463. Prentice Hall, Englewood Cliffs (1973)"},{"key":"7_CR12","unstructured":"Kolmogorov, A.N., Uspensky, V.: On the definition of algorithm. In: Uspekhi Mat. Naut., vol.\u00a013(4), pp. 3\u201328 (1958)"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0890-5401(03)00011-7","volume":"183","author":"J.-Y. Marion","year":"2003","unstructured":"Marion, J.-Y.: Analysing the implicit complexity of programs. Inform. and Comp.\u00a0183(1), 2\u201318 (2003)","journal-title":"Inform. and Comp."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Plump, D.: Graph-reducible term rewriting systems. Graph-Grammars and Their Application to Computer Science, pp. 622\u2013636 (1990)","DOI":"10.1007\/BFb0017417"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1137\/0209036","volume":"9","author":"A. Sch\u00f6nage","year":"1980","unstructured":"Sch\u00f6nage, A.: Storage modification machines. SIAM J. Comput.\u00a09, 490\u2013508 (1980)","journal-title":"SIAM J. Comput."},{"key":"7_CR16","first-page":"1","volume-title":"Handbook of Theoretical Computer Science. Algorithms and Complexity (A)","author":"P. Emde Boas van","year":"1990","unstructured":"van Emde Boas, P.: Machine models and simulation. In: Handbook of Theoretical Computer Science. Algorithms and Complexity (A), vol.\u00a0A, pp. 1\u201366. MIT Press, Cambridge (1990)"}],"container-title":["Lecture Notes in Computer Science","Foundational and Practical Aspects of Resource Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15331-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T00:41:59Z","timestamp":1559608919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15331-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153303","9783642153310"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15331-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}