no. 4
Lambda-Upsilon-Omega : an Assistant Algorithms Analyzer
Publications mathématiques et informatique de Rennes, no. 4 (1989), pp. 203-216. 
@article{PSMIR_1989___4_203_0,
     author = {Flajolet, Philippe and Salvy, Bruno and Zimmermann, Paul},
     title = {Lambda-Upsilon-Omega : an Assistant Algorithms Analyzer},
     journal = {Publications math\'ematiques et informatique de Rennes},
     pages = {203--216},
     publisher = {D\'epartement de Math\'ematiques et Informatique, Universit\'e de Rennes},
     number = {4},
     year = {1989},
     language = {en},
     url = {www.numdam.org/item/PSMIR_1989___4_203_0/}
}
Flajolet, Philippe; Salvy, Bruno; Zimmermann, Paul. Lambda-Upsilon-Omega : an Assistant Algorithms Analyzer. Publications mathématiques et informatique de Rennes, no. 4 (1989), pp. 203-216. http://www.numdam.org/item/PSMIR_1989___4_203_0/

N. G. De Bruijn [1981]. Asymptotic Methods in Analysis. Dover, New York, 1981. | MR 671583 | Zbl 0082.04202

L. Comtet [1974]. Advanced Combinatorics. Reidel, Dordrecht, 1974. | MR 460128

P. Flajolet [1985]. Elements of a general theory of combinatorial structures, in Proc. FCT Conf., Lecture Notes in Comp. Sc, Springer Verlag, 1985,112-127. | MR 821230 | Zbl 0596.05007

Ph. Flajolet [1988]. "Mathematical Methods in the Analysis of Algorithms and Data Structures," in Trends in Theoretical Computer Science, E Börger Editor, Computer Science Press, 1988. | MR 918993

P. Flajolet and A. M. Odlyzko [1987]."Singularity Analysis of Generating Functions", preprint, 1987. | Zbl 0712.05004

P. Flajolet and J-M. Steyaert [1987]."A Complexity Calculus for Recursive Tree Algorihms," J. of Computer and System Sciences 19, 1987, 301-331. | MR 888494 | Zbl 0658.68049

I. Goulden and D. Jackson [1983]. Combinatorial Enumerations. Wiley, New York, 1983. | MR 702512

D. H. Greene [1983]. "Labelled Formal Languages and Their Uses," Stanford University, Technical Report STAN-CS-83-982, 1983.

B. Harris and L. Schoenfeld [1968]. "Asymptotic Expansions for the Coefficients of Analytic Functions," Illinois J. Math. 12, 1968, 264-277. | MR 224801 | Zbl 0202.35801

W. K. Hayman [1956]. _A Generalization of Stirling_s Formula_, J. Reine und Angewandte Mathematik 196,1956, 67-95. | MR 80749 | Zbl 0072.06901

P. Henrici [1977]. Applied and Computational Complex Analysis. Three Volumes. Wiley, New York, 1977. | MR 372162

T. Hickey and J. Cohen [1988]. "Automatic Program Analysis," J.A.C.M. 35,1988, 185-220 | MR 926179 | Zbl 0632.68013

D. E. Knuth [1973a]. The Art of Computer Programming. Volume 1: Fundamental Algorithms. Addison-Wesley, Reading, MA, second edition 1973. | MR 3077152 | Zbl 0895.68055

D. E. Knuth [1973b], The Art of Computer Programming. Volume 3: Sorting and Searching. Addison-Wesley, Reading, MA, 1973. | MR 445948 | Zbl 1127.68068

A. Meir and J. W. Moon [1978]. "On the Altitude of Nodes in Random Trees," Canadian Journal of Mathematics 30, 1978, 997-1015. | MR 506256 | Zbl 0394.05015

G. Pólya [1937]. "Kombinatorische Anzahlbestimmungen fur Gruppen, Graphen und chemische Verbindungen," Acta Mathematica 68, 1937, 145-254. Translated in: G. | JFM 63.0547.04 | MR 1577579 | Zbl 0017.23202

Polya and R. C. Read, Combinatorial Enumeration of Groups, Graphs and Chemical Compounds, Springer, New-York, 1987. | MR 884155

V. N. Sachkov [1978]. Verojatnostnie Metody v Kombinatornom Analize, Nauka, Moscow, 1978. | MR 522165 | Zbl 0517.05001

R. Sedgewick [1983]. Algorithms. Addison-Wesley, Reading, 1983. | MR 784432 | Zbl 0529.68002

R. P. Stanley [1978]."Generating Functions," in Studies in Combinatorics, edited by G-C. Rota, M. A. A. Monographs, 1978. | MR 513004 | Zbl 0422.05003

R. P. Stanley [1986]. Enumerative Combinatorics, Wadsworth and Brooks/Cole, Monterey, 1986. | Zbl 0608.05001

J-M. Steyaert [1984]. "Complexité et Structure des Algorithmes", These de Doctoratès-Sciences, Université Paris 7, 1984.