Lambda-Upsilon-Omega : an Assistant Algorithms Analyzer

Philippe Flajolet; Bruno Salvy; Paul Zimmermann

Publications mathématiques et informatique de Rennes (1989)

  • Issue: 4, page 203-216

How to cite

top

Flajolet, Philippe, Salvy, Bruno, and Zimmermann, Paul. "Lambda-Upsilon-Omega : an Assistant Algorithms Analyzer." Publications mathématiques et informatique de Rennes (1989): 203-216. <http://eudml.org/doc/274752>.

@article{Flajolet1989,
author = {Flajolet, Philippe, Salvy, Bruno, Zimmermann, Paul},
journal = {Publications mathématiques et informatique de Rennes},
keywords = {algorithms analyzer; automatic analysis; data structures; Algebraic Analyzer; generating functions; combinatorial analysis; data types; term trees; average case analyzes of algorithms; analysis of algorithms},
language = {eng},
number = {4},
pages = {203-216},
publisher = {Département de Mathématiques et Informatique, Université de Rennes},
title = {Lambda-Upsilon-Omega : an Assistant Algorithms Analyzer},
url = {http://eudml.org/doc/274752},
year = {1989},
}

TY - JOUR
AU - Flajolet, Philippe
AU - Salvy, Bruno
AU - Zimmermann, Paul
TI - Lambda-Upsilon-Omega : an Assistant Algorithms Analyzer
JO - Publications mathématiques et informatique de Rennes
PY - 1989
PB - Département de Mathématiques et Informatique, Université de Rennes
IS - 4
SP - 203
EP - 216
LA - eng
KW - algorithms analyzer; automatic analysis; data structures; Algebraic Analyzer; generating functions; combinatorial analysis; data types; term trees; average case analyzes of algorithms; analysis of algorithms
UR - http://eudml.org/doc/274752
ER -

References

top
  1. N. G. De Bruijn [1981]. Asymptotic Methods in Analysis. Dover, New York, 1981. Zbl0082.04202MR671583
  2. L. Comtet [1974]. Advanced Combinatorics. Reidel, Dordrecht, 1974. MR460128
  3. 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. Zbl0596.05007MR821230
  4. 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. MR918993
  5. P. Flajolet and A. M. Odlyzko [1987]."Singularity Analysis of Generating Functions", preprint, 1987. Zbl0712.05004
  6. P. Flajolet and J-M. Steyaert [1987]."A Complexity Calculus for Recursive Tree Algorihms," J. of Computer and System Sciences19, 1987, 301-331. Zbl0658.68049MR888494
  7. I. Goulden and D. Jackson [1983]. Combinatorial Enumerations. Wiley, New York, 1983. Zbl0519.05001MR702512
  8. D. H. Greene [1983]. "Labelled Formal Languages and Their Uses," Stanford University, Technical Report STAN-CS-83-982, 1983. 
  9. B. Harris and L. Schoenfeld [1968]. "Asymptotic Expansions for the Coefficients of Analytic Functions," Illinois J. Math.12, 1968, 264-277. Zbl0202.35801MR224801
  10. W. K. Hayman [1956]. _A Generalization of Stirling_s Formula_, J. Reine und Angewandte Mathematik196,1956, 67-95. Zbl0072.06901MR80749
  11. P. Henrici [1977]. Applied and Computational Complex Analysis. Three Volumes. Wiley, New York, 1977. Zbl0363.30001MR372162
  12. T. Hickey and J. Cohen [1988]. "Automatic Program Analysis," J.A.C.M.35,1988, 185-220 Zbl0632.68013MR926179
  13. D. E. Knuth [1973a]. The Art of Computer Programming. Volume 1: Fundamental Algorithms. Addison-Wesley, Reading, MA, second edition1973. Zbl0895.68055MR3077152
  14. D. E. Knuth [1973b], The Art of Computer Programming. Volume 3: Sorting and Searching. Addison-Wesley, Reading, MA, 1973. Zbl1127.68068MR445948
  15. A. Meir and J. W. Moon [1978]. "On the Altitude of Nodes in Random Trees," Canadian Journal of Mathematics30, 1978, 997-1015. Zbl0394.05015MR506256
  16. G. Pólya [1937]. "Kombinatorische Anzahlbestimmungen fur Gruppen, Graphen und chemische Verbindungen," Acta Mathematica68, 1937, 145-254. Translated in: G. Zbl0017.23202MR1577579JFM63.0547.04
  17. Polya and R. C. Read, Combinatorial Enumeration of Groups, Graphs and Chemical Compounds, Springer, New-York, 1987. MR884155
  18. V. N. Sachkov [1978]. Verojatnostnie Metody v Kombinatornom Analize, Nauka, Moscow, 1978. Zbl0517.05001MR522165
  19. R. Sedgewick [1983]. Algorithms. Addison-Wesley, Reading, 1983. Zbl0529.68002MR784432
  20. R. P. Stanley [1978]."Generating Functions," in Studies in Combinatorics, edited by G-C. Rota, M. A. A. Monographs, 1978. Zbl0422.05003MR513004
  21. R. P. Stanley [1986]. Enumerative Combinatorics, Wadsworth and Brooks/Cole, Monterey, 1986. Zbl0608.05001
  22. J-M. Steyaert [1984]. "Complexité et Structure des Algorithmes", These de Doctoratès-Sciences, Université Paris 7, 1984. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.