scientific article; zbMATH DE number 3854413
From MaRDI portal
Publication:3323261
asymptotic behaviorgenerating functionspartial unificationalgebraic translation rules for data and control structuresaverage case analysis of tree algorithmsreduction and simplification of expressionsrestricted programming language over tree structuresstructurally complex programssymbolic differentiation algorithmstree-matching
Recommendations
Cited in
(16)- A complexity calculus for recursive tree algorithms
- scientific article; zbMATH DE number 3881890 (Why is no real title available?)
- On the recursion depth of special tree traversal algorithms
- On the complexity of algorithms on recursive trees
- On the complexity of computing treelength
- An operator calculus approach to the evolution of dynamic data structures
- scientific article; zbMATH DE number 88944 (Why is no real title available?)
- scientific article; zbMATH DE number 3978405 (Why is no real title available?)
- Calculational derivation of pointer algorithms from tree operations
- Automating program analysis
- Tree enumeration and tree algorithm complexity computation
- Functions of binary trees and their applications in algorithm complexity analysis
- On the average complexity for the verification of compatible sequences
- Algebraic simplification in computer algebra: an analysis of bottom-up algorithms
- scientific article; zbMATH DE number 1696443 (Why is no real title available?)
- An information technology for efficiency analysis of recursive algorithms using standard complexity recurrences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3323261)
