{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:59:05Z","timestamp":1725551945857},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642122507"},{"type":"electronic","value":"9783642122514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12251-4_19","type":"book-chapter","created":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T23:32:42Z","timestamp":1270855962000},"page":"257-271","source":"Crossref","is-referenced-by-count":4,"title":["Complexity Analysis by Graph Rewriting"],"prefix":"10.1007","author":[{"given":"Martin","family":"Avanzini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Moser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","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)"},{"unstructured":"Avanzini, M., Moser, G.: Complexity Analysis by Rewriting. Technical report, Computational Logic (November 2008), http:\/\/cl-informatik.uibk.ac.at\/~zini\/publications\/FLOPS08_techreport.pdf","key":"19_CR2"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-02348-4_4","volume-title":"Rewriting Techniques and Applications","author":"M. Avanzini","year":"2009","unstructured":"Avanzini, M., Moser, G.: Dependency Pairs and Polynomial Path Orders. In: Treinen, R. (ed.) RTA 2009. LNCS, vol.\u00a05595, pp. 48\u201362. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Avanzini, M., Moser, G.: Complexity Analysis by Graph Rewriting. Technical report, Computational Logic (December 2010), http:\/\/cl-informatik.uibk.ac.at\/~zini\/publications\/FLOPS10_techreport.pdf","key":"19_CR4","DOI":"10.1007\/978-3-642-12251-4_19"},{"key":"19_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/3-540-17945-3_9","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"H. Barendregt","year":"1987","unstructured":"Barendregt, H., Eekelen, M.v., Glauert, J., Kennaway, R., Plasmeijer, M., Sleep, R.: Towards an Intermediate Language based on Graph Rewriting. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol.\u00a0259, pp. 159\u2013175. Springer, Heidelberg (1987)"},{"doi-asserted-by":"crossref","unstructured":"Dal Lago, U., Martini, S.: Derivational complexity is an invariant cost model. In: Proc. 1st FOPARA (2009)","key":"19_CR7","DOI":"10.1007\/978-3-642-15331-0_7"},{"key":"19_CR8","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 Rewrite 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":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-59340-3_2","volume-title":"Term Rewriting","author":"N. Dershowitz","year":"1995","unstructured":"Dershowitz, N.: 33 Examples of Termination. In: Comon, H., Jouannaud, J.-P. (eds.) TCS School 1993. LNCS, vol.\u00a0909, pp. 16\u201326. Springer, Heidelberg (1995)"},{"key":"19_CR10","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":"19_CR11","first-page":"2","volume":"183","author":"J.-Y. Marion","year":"2003","unstructured":"Marion, J.-Y.: Analysing the Implicit Complexity of Programs. IC\u00a0183, 2\u201318 (2003)","journal-title":"IC"},{"doi-asserted-by":"crossref","unstructured":"Plump, D.: Essentials of Term Graph Rewriting. ENTCS\u00a051 (2001)","key":"19_CR12","DOI":"10.1016\/S1571-0661(04)80210-X"},{"key":"19_CR13","series-title":"Cambridge Tracks in Theoretical Computer Science","volume-title":"Term Rewriting Systems","author":"TeReSe","year":"2003","unstructured":"TeReSe: Term Rewriting Systems. Cambridge Tracks in Theoretical Computer Science, vol.\u00a055. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12251-4_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:52:00Z","timestamp":1606186320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12251-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642122507","9783642122514"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12251-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}