Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Machine models and simulations
Handbook of theoretical computer science (vol. A)
Computability and complexity: from a programming perspective
Computability and complexity: from a programming perspective
Parallel beta reduction is not elementary recursive
Information and Computation
On Lexicographic Termination Ordering with Space Bound Certifications
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Graph-Reducible Term Rewriting Systems
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Analysing the implicit complexity of programs
Information and Computation - Special issue: ICC '99
(Optimal) duplication is not elementary recursive
Information and Computation
Automated Complexity Analysis Based on the Dependency Pair Method
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
On Constructor Rewrite Systems and the Lambda-Calculus
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Complexity invariance of real interpretations
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Complexity analysis by graph rewriting
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
| Hi-index | 0.00 |
We show that in the context of orthogonal term rewriting systems, derivational complexity is an invariant cost model, both in innermost and in outermost reduction. This has some interesting consequences for (asymptotic) complexity analysis, since many existing methodologies only guarantee bounded derivational complexity.