Complexity Analysis by Graph Rewriting-Reference-Cited by-同舟云学术

Complexity Analysis by Graph Rewriting

Published:2010 Issue: Volume: Page:257-271
ISSN:0302-9743
Container-title:Functional and Logic Programming
language:
Short-container-title:

Author:

Avanzini Martin,Moser Georg

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-12251-4_19.pdf

Reference13 articles.

1. Lecture Notes in Computer Science;M. Avanzini,2008

2. 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

3. Lecture Notes in Computer Science;M. Avanzini,2009

4. 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

5. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A new order-theoretic characterisation of the polytime computable functions;Theoretical Computer Science;2015-06

2. Polynomial Path Orders;Logical Methods in Computer Science;2013-11-01

3. The Cost of Usage in the ?-Calculus;2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science;2013-06

4. Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs;Journal of Automated Reasoning;2013-03-02

5. A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems;Lecture Notes in Computer Science;2011