, Volume 22, Issue 4, pp 366–387 | Cite as

Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics

  • H. Prodinger
  • W. Szpankowski


Philippe Flajolet's research in theoretical computer science spans over more than 20 years. He made lasting contributions to the analysis of algorithms and analytic combinatorics. Among many of his results we mention here some in such diversified topics as enumeration, number theory, formal languages, continued fractions, automatic analysis of algorithms, Mellin transform, digital sums, recurrences, trees, random generation of combinatorial objects, random graphs and mappings, polynomial factorization, communications, codes, graphics, etc. This gives only a small snapshot of his work, and we encourage the reader to visit Flajolet's homepage for a fuller account. The bibliography was taken from his homepage and may not be totally complete, although we added a few items. Our paper was written without giving any prior notice to Philippe Flajolet. It reflects the view of the authors and any misunderstandings and shortcomings should be put on their account.

Key words. Singularity analysis, Generating functions, Mellin transform, Digital sums, Rice's method, Trees, Continued fractions, Random generation, Limit distribution. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 1998

Authors and Affiliations

  • H. Prodinger
    • 1
  • W. Szpankowski
    • 2
  1. 1.Department of Mathematics, University of the Witwatersrand, P.O. Wits, 2050 Johannesburg, South Africa.
  2. 2.Department of Computer Science, Purdue University, West Lafayette, IN 47902, USA.

Personalised recommendations