A complexity calculus for recursive tree algorithms
Open Access
- 1 December 1986
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 19 (1), 301-331
- https://doi.org/10.1007/bf01704918
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Patterns and pattern-matching in trees: An analysisInformation and Control, 1983
- The average height of binary trees and other simple treesJournal of Computer and System Sciences, 1982
- Recognizable formal power series on treesTheoretical Computer Science, 1982
- Periodic oscillations of coefficients of power series that satisfy functional equationsAdvances in Mathematics, 1982
- A unifying look at data structuresCommunications of the ACM, 1980
- On the Altitude of Nodes in Random TreesCanadian Journal of Mathematics, 1978
- Verifying Program PerformanceJournal of the ACM, 1976
- Mechanical program analysisCommunications of the ACM, 1975
- The generalization of Lagrange's expansion and the enumeration of treesMathematical Proceedings of the Cambridge Philosophical Society, 1965
- Generalizations to several variables of Lagrange's expansion, with applications to stochastic processesMathematical Proceedings of the Cambridge Philosophical Society, 1960