Julien David, Rado Rakotonarivo, and Lionel Pournin. Elementary moves on lattice polytopes. Journal of Combinatorial Theory, Series A 172, 105200 (2020).
Julien David, Lionel Pournin, Rado Rakotonarivo, Random generation of lattice polytopes. Gascom 2018, 132–139 (2018).
Julien David, Roland Grappe, Mathieu Lacroix and Emiliano Traversi, Self-sufficient sets in smartgrids. Electronic Notes in Discrete Mathematics (ENDM), Vol. 69, pages 301-308 (2018)
Olivier Bodini, Julien David and Philippe Marchal.
Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications. CALDAM 2016: 97-114.
Frederique Bassino, Julien David, and Andrea Sportiello. Asymptotic Enumeration of Minimal Automata.
29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Paris, France. vol. 14 in Leibniz International Proceedings in Informatics (LIPIcs) pp. 88-99. March 2012.
Julien David. The Average Complexity of Moore's State Minimization Algorithm is O(n log log n).
In Petr Hlineny and Antonin Kucera, editors, 35th International Symposium on Mathematical Foundations of Computer Science (MFCS'10).
April 2010, volume 6281, pp 318-329.
Errata: In Algorithm 2, line 7 should be s[sigma(p)] and s[sigma(p-1)] instead of s[p] and s[p-1].
Frederique Bassino, Julien David, and Cyril Nicaud. On the average complexity of Moore's state minimization algorithm.
In Susanne Albers and Jean-Yves Marion, editors, 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), Freiburg, Germany, volume 3 of LIPIcs, pp 123-124. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2009.
Frederique Bassino, Julien David, and Cyril Nicaud. REGAL: a library to randomly and exhaustively generate automata. In, Jan Holub, Jan
Zdarek, editors, 12th International Conference on Implementation and Application of Automata (CIAA'07). vol. 4783. LNCS. Prague, Czech Republic. July 2007. pp. 303-305.Springer-Verlag.