Automated complexity analysis based on ordered resolution
Journal of the ACM (JACM)
Termination Proofs by Context-Dependent Interpretations
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Complexity Analysis Based on Ordered Resolution
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
An upper bound on the derivational complexity of Knuth--Bendix orderings
Information and Computation - Special issue: ICC '99
Arctic Termination ...Below Zero
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Automated Implicit Computational Complexity Analysis (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Automated Complexity Analysis Based on the Dependency Pair Method
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Complexity, Graphs, and the Dependency Pair Method
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Dependency Pairs and Polynomial Path Orders
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
The Derivational Complexity Induced by the Dependency Pair Method
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Max/plus tree automata for termination of term rewriting
Acta Cybernetica
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Characterising space complexity classes via Knuth-Bendix orders
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
A dependency pair framework for innermost complexity analysis of term rewrite systems
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Derivational complexity of knuth-bendix orders revisited
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Complexity invariance of real interpretations
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Quasi-interpretations and small space bounds
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
The derivational complexity of string rewriting systems
Theoretical Computer Science
Simplification Orderings: History Of Results
Fundamenta Informaticae
Hi-index | 0.00 |