scientific article; zbMATH DE number 3854413
zbMATH Open0537.68040MaRDI QIDQ3323261FDOQ3323261
Authors: Jean-Marc Steyaert, Philippe Flajolet 
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
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
Analysis of algorithms and problem complexity (68Q25) Theory of software (68N99) Algorithms in computer science (68W99)
Cited In (16)
- A complexity calculus for recursive tree algorithms
- Title not available (Why is that?)
- On the recursion depth of special tree traversal algorithms
- On the complexity of algorithms on recursive trees
- An operator calculus approach to the evolution of dynamic data structures
- On the complexity of computing treelength
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automating program analysis
- Tree enumeration and tree algorithm complexity computation
- Calculational derivation of pointer algorithms from tree operations
- Functions of binary trees and their applications in algorithm complexity analysis
- On the average complexity for the verification of compatible sequences
- Title not available (Why is that?)
- Algebraic simplification in computer algebra: an analysis of bottom-up algorithms
- 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)
