|Died||22 March 2011 (aged 62)|
|Alma mater||Paris-Sud 11 University|
University Paris Diderot
|Awards||Knight of the Légion d'honneur |
CNRS Silver Medal
Doctor honoris causa from Université libre de Bruxelles
|Fields||Mathematics, Computer Science|
University of Paris
|Doctoral advisor||Maurice Nivat|
|Doctoral students||Paul Zimmermann|
A former student of École Polytechnique, Philippe Flajolet received his PhD in computer science from University Paris Diderot in 1973 and state doctorate from Paris-Sud 11 University in 1979. Most of Philippe Flajolet's research work was dedicated towards general methods for analyzing the computational complexity of algorithms, including the theory of average-case complexity. He introduced the theory of analytic combinatorics. With Robert Sedgewick of Princeton University, he wrote the first book-length treatment of the topic, the 2009 book entitled Analytic Combinatorics. In 1993, together with Rainer Kemp, Helmut Prodinger and Robert Sedgewick, Flajolet initiated the successful series of workshops and conferences which was key to the development of a research community around the analysis of algorithms, and which evolved into the AofA—International Meeting on Combinatorial, Probabilistic, and Asymptotic Methods in the Analysis of Algorithms.
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.