{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:54:41Z","timestamp":1762458881507},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214929"},{"type":"electronic","value":"9783642214936"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21493-6_1","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T12:42:44Z","timestamp":1308573764000},"page":"1-20","source":"Crossref","is-referenced-by-count":4,"title":["Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems"],"prefix":"10.1007","author":[{"given":"Aart","family":"Middeldorp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Moser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedrich","family":"Neurauter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Waldmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harald","family":"Zankl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","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":"1_CR2","first-page":"101","volume":"402","author":"J. Bell","year":"2005","unstructured":"Bell, J.: A gap result for the norms of semigroups of matrices. LAA\u00a0402, 101\u2013110 (2005)","journal-title":"LAA"},{"volume-title":"Handbook of Weighted Automata","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer, Heidelberg (2009)","key":"1_CR3"},{"issue":"2-3","key":"1_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10817-007-9087-9","volume":"40","author":"J. Endrullis","year":"2008","unstructured":"Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. JAR\u00a040(2-3), 195\u2013220 (2008)","journal-title":"JAR"},{"unstructured":"Gebhardt, A., Hofbauer, D., Waldmann, J.: Matrix evolutions. In: WST 2007, pp. 4\u20138 (2007)","key":"1_CR5"},{"issue":"4","key":"1_CR6","first-page":"512","volume":"205","author":"A. Geser","year":"2007","unstructured":"Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: On tree automata that certify termination of left-linear term rewriting systems. I&C\u00a0205(4), 512\u2013534 (2007)","journal-title":"I&C"},{"key":"1_CR7","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":"1_CR8","volume-title":"Matrix Analysis","author":"R. Horn","year":"1990","unstructured":"Horn, R., Johnson, C.: Matrix Analysis. Cambridge University Press, Cambridge (1990)"},{"issue":"10","key":"1_CR9","first-page":"2296","volume":"428","author":"R.M. Jungers","year":"2008","unstructured":"Jungers, R.M., Protasov, V., Blondel, V.D.: Efficient algorithms for deciding the type of growth of products of integer matrices. LAA\u00a0428(10), 2296\u20132311 (2008)","journal-title":"LAA"},{"key":"1_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95980-9","volume-title":"The Joint Spectral Radius: Theory and Applications","author":"R. Jungers","year":"2009","unstructured":"Jungers, R.: The Joint Spectral Radius: Theory and Applications. Springer, Heidelberg (2009)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-70590-1_14","volume-title":"Rewriting Techniques and Applications","author":"A. Koprowski","year":"2008","unstructured":"Koprowski, A., Waldmann, J.: Arctic termination...Below zero. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 202\u2013216. Springer, Heidelberg (2008)"},{"unstructured":"Moser, G.: Proof Theory at Work: Complexity Analysis of Term Rewrite Systems. Habilitation thesis, University of Innsbruck (2009)","key":"1_CR12"},{"unstructured":"Moser, G., Schnabl, A.: The derivational complexity induced by the dependency pair method. LMCS (2011) (to appear), \n                    \n                      http:\/\/arxiv.org\/abs\/0904.0570","key":"1_CR13"},{"key":"1_CR14","series-title":"LIPIcs","first-page":"304","volume-title":"FSTTCS 2008","author":"G. Moser","year":"2008","unstructured":"Moser, G., Schnabl, A., Waldmann, J.: Complexity analysis of term rewriting based on matrix and context dependent interpretations. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2008. LIPIcs, vol.\u00a02, pp. 304\u2013315. Schloss Dagstuhl, Dagstuhl (2008)"},{"key":"1_CR15","series-title":"LNCS(ARCoSS)","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1007\/978-3-642-16242-8_39","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"F. Neurauter","year":"2010","unstructured":"Neurauter, F., Zankl, H., Middeldorp, A.: Revisiting matrix interpretations for polynomial derivational complexity of term rewriting. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS(ARCoSS), vol.\u00a06397, pp. 550\u2013564. Springer, Heidelberg (2010)"},{"key":"1_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8189-0","volume-title":"Linear Algebra: A Pure Mathematical Approach","author":"H.E. Rose","year":"2002","unstructured":"Rose, H.E.: Linear Algebra: A Pure Mathematical Approach. Birkh\u00e4user, Basel (2002)"},{"key":"1_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J. Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)"},{"key":"1_CR18","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Term Rewriting Systems","author":"Terese","year":"2003","unstructured":"Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press, Cambridge (2003)"},{"key":"1_CR19","series-title":"LIPIcs","first-page":"357","volume-title":"RTA 2010","author":"J. Waldmann","year":"2010","unstructured":"Waldmann, J.: olynomially bounded matrix interpretations. In: Lynch, C. (ed.) RTA 2010. LIPIcs, vol.\u00a06, pp. 357\u2013372. Schloss Dagstuhl, Dagstuhl (2010)"},{"issue":"2","key":"1_CR20","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(91)90381-B","volume":"88","author":"A. Weber","year":"1991","unstructured":"Weber, A., Seidl, H.: On the degree of ambiguity of finite automata. TCS\u00a088(2), 325\u2013349 (1991)","journal-title":"TCS"},{"key":"1_CR21","series-title":"LIPIcs","first-page":"385","volume-title":"RTA 2010","author":"H. Zankl","year":"2010","unstructured":"Zankl, H., Korp, M.: Modular complexity analysis via relative complexity. In: Lynch, C. (ed.) RTA 2010. LIPIcs, vol.\u00a06, pp. 385\u2013400. Schloss Dagstuhl, Dagstuhl (2010)"},{"key":"1_CR22","series-title":"LNCS(LNAI)","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-17511-4_27","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"H. Zankl","year":"2010","unstructured":"Zankl, H., Middeldorp, A.: Satisfiability of non-linear (ir)rational arithmetic. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16. LNCS(LNAI), vol.\u00a06355, pp. 481\u2013500. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21493-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T07:06:23Z","timestamp":1553843183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21493-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214929","9783642214936"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21493-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}