Julien David

According to our database, Julien David authored at least 14 papers between 2007 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Approximate Cartesian Tree Matching: An Approach Using Swaps.

Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq

Proceedings of the String Processing and Information Retrieval, 2023

2020

Elementary moves on lattice polytopes.

Julien David, Lionel Pournin, Rado Rakotonarivo

J. Comb. Theory, Ser. A, 2020

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

Proceedings of the Optical Fiber Communications Conference and Exposition, 2018

A Markov chain for lattice polytopes.

Julien David, Lionel Pournin, Rado Rakotonarivo

Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

2016

Parallel Galton Watson Process.

Olivier Bodini, Camille Coti, Julien David

CoRR, 2016

Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications.

Olivier Bodini, Julien David, Philippe Marchal

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015

An average study of hypergraphs and their minimal transversals.

Julien David, Loïck Lhote, Arnaud Mary, François Rioult

Theor. Comput. Sci., 2015

2012

Average complexity of Moore's and Hopcroft's algorithms.

Julien David

Theor. Comput. Sci., 2012

Average Case Analysis of Moore's State Minimization Algorithm.

Frédérique Bassino, Julien David, Cyril Nicaud

Algorithmica, 2012

Asymptotic enumeration of Minimal Automata.

Frédérique Bassino, Julien David, Andrea Sportiello

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

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

PhD thesis, 2010

The Average Complexity of Moore's State Minimization Algorithm Is O(n log log n).

Julien David

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

On the Average Complexity of Moore's State Minimization Algorithm.

Frédérique Bassino, Julien David, Cyril Nicaud

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2007

: A Library to Randomly and Exhaustively Generate Automata.

Frédérique Bassino, Julien David, Cyril Nicaud

Proceedings of the Implementation and Application of Automata, 2007