Philippe Flajolet, in 2006, at the Analysis of Algorithms international conference
1 December 1948|
|Died||22 March 2011
|Fields||Mathematics, Computer Science|
University of Paris
|Alma mater||Paris-Sud 11 University
University Paris Diderot
|Doctoral advisor||Maurice Nivat
|Doctoral students||Claude Puech
|Notable awards||Knight of the Légion d'honneur
Médaille d'argent du CNRS (Silver Medal from CNRS)
Doctor honoris causa from Université libre de Bruxelles
A former student of École Polytechnique, Philippe Flajolet received his Ph.D. 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.
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 : Algorithmix nous a quittés !" [Philippe Flajolet : Algorithmix has departed this world !]. INRIA Alumni (in French). 23 March 2011.
- 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, August 1987.
|This article about a French computer specialist is a stub. You can help Wikipedia by expanding it.|