Darwin: Computer algebra and enumerative combinatorics

  • F. Bergeron
  • G. Cartier
Systems Demonstrations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 294)


  1. [BLL]
    F.Bergeron, G.Labelle, and P.Leroux; Functional Equation for Data Structures, this volume.Google Scholar
  2. [BK]
    R.P. Brent and H.T. Kung; Fast Algorithms for Manipulating Formal Power Series, JACM 25 (4), 1978, pp 581–595.Google Scholar
  3. [F]
    P. Flajolet; Elements of a General Theory of Combinatorial Structures, Proceedings FCT85, L. Budach, Ed., Lect. Notes in Comp. Science, Springer-Verlag, Vol. 199 (1985), pp. 112–127.Google Scholar
  4. [G]
    G.H. Gonnet; Handbook of Algorithms and Data Structures, International Computer Science Series, Addison-Wesley, 1984.Google Scholar
  5. [J]
    A. Joyal; Une théorie combinatoire des séries formelles, Adv. in Math. 42, 1981, pp 1–82.Google Scholar
  6. [GL]
    G. Labelle; Une combinatoire sous-jacente au théorème des fonctions implicites, J. Combin. Theory, Series A, 40, 1985, pp 377–393Google Scholar
  7. [V]
    J. Vuillemin; A Unifying Look at Data Structures, Comm. of ACM, Vol 23 (4), 1980, pp 229–239.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • F. Bergeron
    • 1
  • G. Cartier
    • 1
  1. 1.Dept. Maths and InfoUQAMSucc. A, MontréalCanada

Personalised recommendations