{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:19:49Z","timestamp":1725567589911},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642162411"},{"type":"electronic","value":"9783642162428"}],"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-16242-8_11","type":"book-chapter","created":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T08:51:59Z","timestamp":1286182319000},"page":"142-156","source":"Crossref","is-referenced-by-count":0,"title":["Characterising Space Complexity Classes via Knuth-Bendix Orders"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Bonfante","sequence":"first","affiliation":[]},{"given":"Georg","family":"Moser","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_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)"},{"key":"11_CR2","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)"},{"key":"11_CR3","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)"},{"issue":"1","key":"11_CR4","first-page":"33","volume":"11","author":"G. Bonfante","year":"2001","unstructured":"Bonfante, G., Cichon, A., Marion, J.Y., Touzet, H.: Algorithms with polynomial interpretation termination proof. JFP\u00a011(1), 33\u201353 (2001)","journal-title":"JFP"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-32033-3_12","volume-title":"Term Rewriting and Applications","author":"G. Bonfante","year":"2005","unstructured":"Bonfante, G., Marion, J.Y., Moyen, J.Y.: Quasi-interpretations and small space bounds. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 150\u2013164. Springer, Heidelberg (2005)"},{"unstructured":"Hofbauer, D.: Termination Proofs and Derivation Lengths in Term Rewriting Systems. Ph.D. thesis, Technische Universit\u00e4t Berlin (1992)","key":"11_CR6"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(92)90289-R","volume":"105","author":"D. Hofbauer","year":"1992","unstructured":"Hofbauer, D.: Termination proofs with multiset path orderings imply primitive recursive derivation lengths. TCS\u00a0105(1), 129\u2013140 (1992)","journal-title":"TCS"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-51081-8_107","volume-title":"Rewriting Techniques and Applications","author":"D. Hofbauer","year":"1989","unstructured":"Hofbauer, D., Lautemann, C.: Termination Proofs and the Length of Derivation. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol.\u00a0355, pp. 167\u2013177. Springer, Heidelberg (1989)"},{"unstructured":"Knuth, D., Bendix, P.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational problems in abstract algebra. Pergamon, Oxford (1970)","key":"11_CR9"},{"key":"11_CR10","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)"},{"key":"11_CR11","volume-title":"Theory of Computation","author":"D. Kozen","year":"2006","unstructured":"Kozen, D.: Theory of Computation. Springer, Heidelberg (2006)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/S0304-3975(01)00015-9","volume":"269","author":"I. Lepper","year":"2001","unstructured":"Lepper, I.: Derivation lengths and order types of Knuth-Bendix orders. TCS\u00a0269, 433\u2013450 (2001)","journal-title":"TCS"},{"key":"11_CR13","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"},{"key":"11_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/11916277_6","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"G. Moser","year":"2006","unstructured":"Moser, G.: Derivational complexity of Knuth Bendix orders revisited. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol.\u00a04246, pp. 75\u201389. Springer, Heidelberg (2006)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-02348-4_18","volume-title":"Rewriting Techniques and Applications","author":"G. Moser","year":"2009","unstructured":"Moser, G., Schnabl, A.: The Derivational Complexity Induced by the Dependency Pair Method. In: Treinen, R. (ed.) RTA 2009. LNCS, vol.\u00a05595, pp. 255\u2013260. Springer, Heidelberg (2009)"},{"key":"11_CR16","first-page":"304","volume-title":"Proc. of 28th FSTTICS","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: Proc. of 28th FSTTICS, pp. 304\u2013315. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2008)"},{"unstructured":"TeReSe: Term Rewriting Systems, Cambridge Tracks in Theoretical Computer Science, vol.\u00a055. Cambridge University Press, Cambridge (2003)","key":"11_CR17"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0304-3975(94)00135-6","volume":"139","author":"A. Weiermann","year":"1995","unstructured":"Weiermann, A.: Termination proofs by lexicographic path orderings yield multiply recursive derivation lengths. Theoretical Computer Science\u00a0139(1), 355\u2013362 (1995)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16242-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T10:20:01Z","timestamp":1553163601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16242-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642162411","9783642162428"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16242-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}