1. A sprouting tree model for random boolean functions1. Issue 4 (31st July 2014) Authors: Chauvin, Brigitte; Gardy, Danièle; Mailler, Cécile Journal: Random structures & algorithms Issue: Volume 47:Issue 4(2015) Page Start: 635 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Arbres pour l'Algorithmique. (2018) Authors: Chauvin, Brigitte, 1960-; Clément, Julien; Gardy, Danièle Record Type: Book Extent: 1 online resource (xxxi, 511 pages) View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Threshold functions for small subgraphs in simple graphs and multigraphs. (August 2020) Authors: Collet, Gwendal; de Panafieu, Élie; Gardy, Danièle; Gittenberger, Bernhard; Ravelomanana, Vlady Journal: European journal of combinatorics Issue: Volume 88(2020) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗