A complexity calculus for recursive tree algorithms

DOI10.1007/BF01704918MaRDI QIDQ3806812zbMATH OpenFDO

Authors Jean-Marc Steyaert, Philippe Flajolet

Publication date 1987

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01704918

zbMATH Keywords

generating functionsrecursive tree algorithmssingularities

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Theory of software (68N99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3854413
• On the complexity of algorithms on recursive trees
• Tree enumeration and tree algorithm complexity computation
• scientific article; zbMATH DE number 3978405
• Singularity analysis, Hadamard products, and tree recurrences

Cites work

• A unifying look at data structures
• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 3502750 (Why is no real title available?)
• scientific article; zbMATH DE number 3219337 (Why is no real title available?)
• scientific article; zbMATH DE number 3230025 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• Mechanical program analysis
• On the Altitude of Nodes in Random Trees
• Patterns and pattern-matching in trees: An analysis
• Periodic oscillations of coefficients of power series that satisfy functional equations
• Recognizable formal power series on trees
• The average height of binary trees and other simple trees
• Verifying Program Performance

Cited in

(25)

• Automatic average-case analysis of algorithms
• Complexity analysis of term-rewriting systems
• Calculational derivation of pointer algorithms from tree operations
• On sets of integers with prescribed gaps
• Singularity analysis, Hadamard products, and tree recurrences
• Tree enumeration and tree algorithm complexity computation
• An information technology for efficiency analysis of recursive algorithms using standard complexity recurrences
• scientific article; zbMATH DE number 1696443 (Why is no real title available?)
• scientific article; zbMATH DE number 3881890 (Why is no real title available?)
• scientific article; zbMATH DE number 3854413 (Why is no real title available?)
• scientific article; zbMATH DE number 3978405 (Why is no real title available?)
• Average-case analysis of pattern-matching in trees under the BST probability model
• Mathematical methods for the analysis of recursive algorithms
• On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
• Uniform random expressions lack expressivity
• Analytic analysis of algorithms
• On the asymptotic behavior of some algorithms
• scientific article; zbMATH DE number 2242588 (Why is no real title available?)
• On the recursion depth of special tree traversal algorithms
• Simplifications of Uniform Expressions Specified by Systems
• Heuristic universality detection over regular expressions specified by systems
• Limiting distributions for additive functionals on Catalan trees
• Algebraic simplification in computer algebra: an analysis of bottom-up algorithms
• On the complexity of algorithms on recursive trees
• On the complexity of computing treelength

This page was built for publication: A complexity calculus for recursive tree algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3806812)