The Philippe Flajolet Lecture Prize is awarded to for contributions to analytic combinatorics and analysis of algorithms, in the fields of theoretical computer science.
This lecture is organized as a keynote address at the International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA).
The recipients of the Flajolet Lecture Prize work in a variety of areas, including analysis of algorithms, analytic combinatorics, combinatorics, communication protocols, complex analysis, computational biology, data mining, databases, graphs, information theory, limit distributions, maps, trees, probability, statistical physics.
[2] Knuth surveyed five problems, including enumeration of polyominoes, mathematical tiling, tree pruning, lattice paths, and perturbation theory.
[11] The 2016 lecture by Robert Sedgewick focused on a topic dating back to one of Flajolet's earliest papers, on approximate counting methods for streaming data.