And/Or Trees Revisited. - Brigitte Chauvin; Philippe Flajolet; Danièle Gardy; Bernhard Gittenberger (Comb. Probab. Comput., 2004)

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

The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees. - Brigitte Chauvin; Michael Drmota (Algorithmica, 2006)

The Growing Trees Distribution on Boolean Functions. - Brigitte Chauvin; Danièle Gardy; Cécile Mailler (ANALCO, 2011)

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

A sprouting tree model for random boolean functions. - Brigitte Chauvin; Danièle Gardy; Cécile Mailler (Random Struct. Algorithms, 2015)