Philippe Flajolet (nonfiction): Difference between revisions
(Created page with "[[]]'''Philippe Flajolet''' (French: [flaʒɔlɛ]; 1 December 1948 – 22 March 2011) was a French computer scientist. == Biography == A former student of École Polytechniq...") |
No edit summary |
||
| Line 1: | Line 1: | ||
[[]]'''Philippe Flajolet''' (French: [flaʒɔlɛ]; 1 December 1948 – 22 March 2011) was a French computer scientist. | [[File:Philippe Flajolet.jpg|thumb|Philippe Flajolet.]]'''Philippe Flajolet''' (French: [flaʒɔlɛ]; 1 December 1948 – 22 March 2011) was a French computer scientist. | ||
== Biography == | == Biography == | ||
| Line 5: | Line 5: | ||
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 theory (nonfiction)|computational complexity]] of [[Algorithm (nonfiction)|algorithms]], including the theory of [[Average-case complexity (nonfiction)|average-case complexity]]. He introduced the theory of [[Analytic combinatorics (nonfiction)|analytic combinatorics]]. With [[Robert Sedgewick (nonfiction)|Robert Sedgewick]] of Princeton University, he wrote the first book-length treatment of the topic, the 2009 book ''[[Analytic Combinatorics (nonfiction)|Analytic Combinatorics]]''. | 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 theory (nonfiction)|computational complexity]] of [[Algorithm (nonfiction)|algorithms]], including the theory of [[Average-case complexity (nonfiction)|average-case complexity]]. He introduced the theory of [[Analytic combinatorics (nonfiction)|analytic combinatorics]]. With [[Robert Sedgewick (nonfiction)|Robert Sedgewick]] of Princeton University, he wrote the first book-length treatment of the topic, the 2009 book ''[[Analytic Combinatorics (nonfiction)|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 | 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 [[Wojciech Szpankowski (nonfiction)|Wojciech Szpankowski]], ''Algorithmica 22'' (1998), 366-387. | ||
At the time of his death from a serious illness, Philippe Flajolet was a research director (senior research scientist) at INRIA in Rocquencourt. | At the time of his death from a serious illness, Philippe Flajolet was a research director (senior research scientist) at INRIA in Rocquencourt. | ||
Latest revision as of 18:09, 21 March 2020
Philippe Flajolet (French: [flaʒɔlɛ]; 1 December 1948 – 22 March 2011) was a French computer scientist.
Biography
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 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 Wojciech Szpankowski, Algorithmica 22 (1998), 366-387.
At the time of his death from a serious illness, Philippe Flajolet was 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 was a full member from 2003 on. He was also a member of the Academia Europaea.
Memory
The HyperLogLog commands of Redis, released in April 2014, are prefixed with "PF" in honor of Philippe Flajolet.
Selected works
- with Robert Sedgewick: An Introduction to the Analysis of Algorithms. 2nd edition, Addison-Wesley, Boston, Mass. 1995, ISBN 0-201-40009-X
- with Robert Sedgewick: Analytic Combinatorics. Cambridge University Press, Cambridge 2009, ISBN 978-0-521-89806-5
- Random tree models in the analysis of algorithms. INRIA, Rocquencourt 1987 (Rapports de recherche; Vol. 729)
- with Andrew Odlyzko: Singularity analysis of generating functions. University Press, Stanford, Calif. 1988
References
- "Philippe Flajolet : Algorithmix nous a quittés !" [Philippe Flajolet : Algorithmix has departed this world !]. INRIA Alumni (in French). 23 March 2011. Archived from the original on 18 May 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.
- Salvatore Sanfilippo (1 April 2014). "Redis new data structure: the HyperLogLog". Antirez weblog. Archived from the original on 7 August 2014.
External links
- Philippe Flajolet's Home Page
- Philippe Flajolet and Analytic Combinatorics, Conference in the memory of Philippe Flajolet
- Luc Devroye, Philippe Flajolet, 1 December 1948--22 March 2011
- Philippe Flajolet: Philippe Flajolet, On-Line Encyclopedia of Integer Sequences