Complexity analysis of term-rewriting systems
From MaRDI portal
See the review in Zbl 0657.68027.
Recommendations
- scientific article; zbMATH DE number 4074465
- Complexity analysis for term rewriting by integer transition systems
- Modular complexity analysis for term rewriting
- Algebraic semantics and complexity of term rewriting systems
- Complexity analysis of term rewriting based on matrix and context dependent interpretations
- Reachability analysis over term rewriting systems
- Complexity Analysis by Rewriting
- Analysing parallel complexity of term rewriting
- Complexity of conditional term rewriting
- scientific article; zbMATH DE number 1118018
Cites work
- A complexity calculus for recursive tree algorithms
- A Larch shared language handbook
- Complexity of algebraic implementations for abstract data types
- scientific article; zbMATH DE number 4016182 (Why is no real title available?)
- scientific article; zbMATH DE number 3883604 (Why is no real title available?)
- scientific article; zbMATH DE number 3930339 (Why is no real title available?)
- scientific article; zbMATH DE number 3936505 (Why is no real title available?)
- scientific article; zbMATH DE number 3723836 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 194822 (Why is no real title available?)
- scientific article; zbMATH DE number 4115969 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- On the Altitude of Nodes in Random Trees
- Orderings for term-rewriting systems
- Patterns and pattern-matching in trees: An analysis
- Report on the Larch shared language
Cited in
(12)- Automatic average-case analysis of algorithms
- A combination framework for complexity
- Using term-graph rewriting models to analyse relative space efficiency
- scientific article; zbMATH DE number 6819785 (Why is no real title available?)
- scientific article; zbMATH DE number 7029315 (Why is no real title available?)
- On the enumeration of closures and environments with an application to random generation
- Towards the average-case analysis of substitution resolution in \(\lambda\)-calculus
- Automated Complexity Analysis Based on Context-Sensitive Rewriting
- Analytic analysis of algorithms
- scientific article; zbMATH DE number 2201367 (Why is no real title available?)
- Reachability analysis over term rewriting systems
- Average-case analysis on simple families of trees using a balanced probability model
This page was built for publication: Complexity analysis of term-rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1262761)