Skip to main content
SpringerLink
Log in

Darwin: Computer algebra and enumerative combinatorics

  • Systems Demonstrations
  • Conference paper
  • First Online:
STACS 88 (STACS 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 294))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Bibliography

  1. F.Bergeron, G.Labelle, and P.Leroux; Functional Equation for Data Structures, this volume.

    Google Scholar 

  2. R.P. Brent and H.T. Kung; Fast Algorithms for Manipulating Formal Power Series, JACM 25 (4), 1978, pp 581–595.

    Google Scholar 

  3. 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.H. Gonnet; Handbook of Algorithms and Data Structures, International Computer Science Series, Addison-Wesley, 1984.

    Google Scholar 

  5. A. Joyal; Une théorie combinatoire des séries formelles, Adv. in Math. 42, 1981, pp 1–82.

    Google Scholar 

  6. G. Labelle; Une combinatoire sous-jacente au théorème des fonctions implicites, J. Combin. Theory, Series A, 40, 1985, pp 377–393

    Google Scholar 

  7. J. Vuillemin; A Unifying Look at Data Structures, Comm. of ACM, Vol 23 (4), 1980, pp 229–239.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Maths and Info, UQAM, C.P. 8888, H3C 3P8, Succ. A, Montréal, Canada

    F. Bergeron & G. Cartier

Authors
  1. F. Bergeron
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Cartier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Robert Cori Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bergeron, F., Cartier, G. (1988). Darwin: Computer algebra and enumerative combinatorics. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035863

Download citation

  • DOI: https://doi.org/10.1007/BFb0035863

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18834-6

  • Online ISBN: 978-3-540-48190-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation