: A Library to Randomly and Exhaustively Generate Automata. - Frédérique Bassino; Julien David; Cyril Nicaud (CIAA, 2007)

On the Average Complexity of Moore's State Minimization Algorithm. - Frédérique Bassino; Julien David; Cyril Nicaud (STACS, 2009)

The Average Complexity of Moore's State Minimization Algorithm Is O(n log log n). - Julien David (MFCS, 2010)

Génération aléatoire d'automates et analyse d'algorithmes de minimisation. (Random generation of automata and analysis of their state minimization algorithms). - Julien David (2010)

Asymptotic enumeration of Minimal Automata. - Frédérique Bassino; Julien David; Andrea Sportiello (STACS, 2012)

Average Case Analysis of Moore's State Minimization Algorithm. - Frédérique Bassino; Julien David; Cyril Nicaud (Algorithmica, 2012)

Average complexity of Moore's and Hopcroft's algorithms. - Julien David (Theor. Comput. Sci., 2012)

An average study of hypergraphs and their minimal transversals. - Julien David; Loïck Lhote; Arnaud Mary; François Rioult (Theor. Comput. Sci., 2015)

Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications. - Olivier Bodini; Julien David; Philippe Marchal (CALDAM, 2016)

Parallel Galton Watson Process. - Olivier Bodini; Camille Coti; Julien David (CoRR, 2016)

A Markov chain for lattice polytopes. - Julien David; Lionel Pournin; Rado Rakotonarivo (GASCom, 2018)

31.2-Tb/s Real Time Bidirectional Transmission of 78×400 Gb/s Interleaved Channels over C Band of One 90-km SMF Span. - Thierry Zami; Bruno Lavigne; Oriol Bertran-Pardo; Stefan Weisser; Julien David; Maël Le Monnier; Jean-Paul Faure (OFC, 2018)

Elementary moves on lattice polytopes. - Julien David; Lionel Pournin; Rado Rakotonarivo (J. Comb. Theory A, 2020)

Approximate Cartesian Tree Matching: An Approach Using Swaps. - Bastien Auvray; Julien David; Richard Groult; Thierry Lecroq (SPIRE, 2023)

Real-time transmission of 34.9 Tb/s with 1-Tb/s channels over 4800 GHz-wide C-band along 1000 km of G654E fiber. - Bruno Lavigne; Maël Le Monnier; Thierry Zami; Julien David; Stefan Weisser; Lutz Raddatz; Florian Pulka (OFC, 2024)

Approximate Cartesian Tree Matching with One Difference. - Bastien Auvray; Julien David; Samah Ghazawi; Richard Groult; Gad M. Landau; Thierry Lecroq (CoRR, 2025)

Cartesian Forest Matching. - Bastien Auvray; Julien David; Richard Groult; Thierry Lecroq (CoRR, 2025)