On the Number of Permutations Admitting an m-th Root. - Nicolas Pouyanne (Electron. J. Comb., 2002)

m-ary Search trees when m ge 27: A strong asymptotics for the space requirements. - Brigitte Chauvin; Nicolas Pouyanne (Random Struct. Algorithms, 2004)

A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics. - Philippe Flajolet; Éric Fusy; Xavier Gourdon; Daniel Panario; Nicolas Pouyanne (Electron. J. Comb., 2006)

An algebraic approach of Polya processes - Nicolas Pouyanne (CoRR, 2006)

Uncommon suffix tries. - Peggy Cénac; Brigitte Chauvin; Frédéric Paccaut; Nicolas Pouyanne (Random Struct. Algorithms, 2015)