A Complexity Calculus for Recursive Tree Algorithms
Publications du Département de mathématiques (Lyon), Théorie des langages et complexité des algorithmes, no. 6B (1984), pp. 39-88. 
@article{PDML_1984___6B_A3_0,
     author = {Flajolet, Philippe and Steyaert, Jean-Marc},
     title = {A {Complexity} {Calculus} for {Recursive} {Tree} {Algorithms}},
     journal = {Publications du D\'epartement de math\'ematiques (Lyon)},
     pages = {39--88},
     publisher = {Universit\'e Claude Bernard - Lyon 1},
     number = {6B},
     year = {1984},
     mrnumber = {802632},
     zbl = {0537.68040},
     language = {en},
     url = {http://www.numdam.org/item/PDML_1984___6B_A3_0/}
}
TY  - JOUR
AU  - Flajolet, Philippe
AU  - Steyaert, Jean-Marc
TI  - A Complexity Calculus for Recursive Tree Algorithms
JO  - Publications du Département de mathématiques (Lyon)
PY  - 1984
SP  - 39
EP  - 88
IS  - 6B
PB  - Université Claude Bernard - Lyon 1
UR  - http://www.numdam.org/item/PDML_1984___6B_A3_0/
LA  - en
ID  - PDML_1984___6B_A3_0
ER  - 
%0 Journal Article
%A Flajolet, Philippe
%A Steyaert, Jean-Marc
%T A Complexity Calculus for Recursive Tree Algorithms
%J Publications du Département de mathématiques (Lyon)
%D 1984
%P 39-88
%N 6B
%I Université Claude Bernard - Lyon 1
%U http://www.numdam.org/item/PDML_1984___6B_A3_0/
%G en
%F PDML_1984___6B_A3_0
Flajolet, Philippe; Steyaert, Jean-Marc. A Complexity Calculus for Recursive Tree Algorithms. Publications du Département de mathématiques (Lyon), Théorie des langages et complexité des algorithmes, no. 6B (1984), pp. 39-88. http://www.numdam.org/item/PDML_1984___6B_A3_0/

[BR 82] J. Berstel, C. Reutenauer : "Recognizable formal power series on trees", Theor. Comp. Sc. 18 (1982) pp. 188-145 | MR | Zbl

[Bu 85] W. Burge : Recursive programming techniques Addison Wesley, Reading (1975) | Zbl

[Da 1878] G. Darboux : "Mémoire sur l'approximation des fonctions de très grands nombres, et sur une classe étendue de développements en série", J. de Mathématiques pures et appliquées, 3ème série, tome VI, (Jan 1878) pp. 1-56 | JFM | Numdam

[FO 82] P. Flajolet, A. Odlyzko : "The average height of binary trees and other simple trees", JCSS, vol. 25, No 2, (Oct. 1982) pp. 171-213 | MR | Zbl

[FS 70] D. Foata, M. P. Schutzenberger : Théorie géométrique des polynômes eulériens, Lecture Notes in Mathematics 138, Springer Verlag, Berlin (1970) | MR | Zbl

[Go 60] I. J. Good : "Generalizations to several variables of Lagrange's expansion, with applications to stochastic processes", Proc. Cambridge Phil. Soc. 56 (1960) pp. 367-380 | MR | Zbl

[Go 65] I. J. Good : "The generalization of Lagrange's expansion and the enumeration of trees", Proc. Cambridge Philo. Soc. 61 (1965) pp. 499-517 | MR | Zbl

[He 74] P. Henrici : "Applied and computational complex analysis, 2 vol J. Wiley, New York (1974) | MR | Zbl

[JG 81] D. Jackson, I. Goulden : Combinatorial Decompositions and Algebraic Enumerations (to appear)

[Kn 68] D. E. Knuth : The art of computer programming : Fundamental Algorithms, Addison Wesley, Reading (1968) | MR | Zbl

[Kn 73] D. E. Knuth : The art of computer programming : Sorting and Searching, Addison Wesley, Reading (1973) | MR | Zbl

[MM 78] A. Meir, J. W. Moon : "On the altitude of nodes in random trees", Canad. J. of Math 30 (1978), pp. 997-1015 | MR | Zbl

[Od 82] A. Odlyzko : "Periodic oscillations of coefficients of power series that satisfy functional equations" Adv. in Math. 44 (1982), pp. 180-205. | MR | Zbl

[Po 37] G. Polya : "Kombinatorische Anzahlbestimmungen für Graphen, Grupen und Chemische Verbindungen", Acta Mathematica 68 (1937), pp. 145-254 | MR | Zbl

[Ra 79] L. Ramshaw : "Formalizing the analysis of algorithms", Ph. D Thesis, Stanford Univ. (1979)

[Ro 75] G. C. Rota : Finite Operator Calculs, Academic Press, New-York (1975) | MR

[SF 82] J. M. Steyaert, P. Flajolet : "Patterns and Pattern-matching in trees : an analysis", (to appear in Inf. & Control). | MR | Zbl

[Th 73] J. W. Thatcher : "Tree automata : an informal survey", in Currents in the Theory of Computing (A.V. Aho, ed), Prentice Hall (1973) pp. 143-178. | MR

[Vu 80] J. Vuillemin "A unifying look at data structures", CACM 23 (1980), pp. 229-239. | MR | Zbl

[We 75] B. Wegbreit : "Mechanical program analysis", CACM 18 (1975), pp. 528-532. | MR | Zbl

[We 76] B. Wegbreit : "Verifying program performance, JACM 23 (1976), pp. 691-699. | MR | Zbl