A talk on my work

As a PhD student at Inria Rocquencourt, I gave a talk that provided an overview of how data streaming algorithms like HyperLogLog work, that was aimed at a broader audience of engineering PhD students at the Inria’s Junior Seminar.

Talk that introduces a novel, implementable data streaming algorithm for cardinality estimation, that uses

Talk that introduces novel combinatorial object samplers, for objects in which the size is multiplicative rather than additive (such as for certain kinds of tilings, factorizations, and trees). With Olivier Bodini.

This talk traces the history of data streaming algorithms for the cardinality estimation problem from the 1980s to 2010s through algorithms designed or studied by Philippe Flajolet, and the origins of the world-famous HyperLogLog algorithm.