Philippe (Patrick, Michel) Flajolet (1 December 1948) is a French computer scientist.

A former student of École Polytechnique, Philippe Flajolet got a Ph.D. in computer science from University Paris VII in 1977 and a doctorate of state in 1979. Most of Philippe Flajolet's research work was dedicated towards generic methods for analyzing the computational complexity of algorithms, including the theory of average-case complexity.¹ He introduced the theory of analytic combinatorics.

A summary of his research up to 1998 can be found in the article "Philippe Flajolet's research in Combinatorics and Analysis of Algorithms" by H. Prodinger and W. Szpankowski, Algorithmica 22 (1998), 366-387.

Philippe Flajolet is currently a research director (senior research scientist) at INRIA in Rocquencourt.

From 1994 to 2003 he was a corresponding member of the French Academy of Sciences, and has been a full member from 2003 on. He is also a member of the Academia Europaea.

References

1. ^ Philippe Flajolet and J.S. Vitter. Average-case analysis of algorithms and data structures. Technical report, Institut National de Recherche en Informatique et en Automatique, B.P. 105-78153 Le Chesnay Cedex France, August 1987.

This article on a computer specialist of France is a stub. You can help Wikipedia by expanding it.