4 citations · 7 across the 6 of their papers we have counts for
6 papers
Approximate Cartesian Tree Matching: an Approach Using Swaps
Bastien Auvray, Julien David, Richard Groult +1
Cartesian tree pattern matching consists of finding all the factors of a text that have the same Cartesian tree than a given pattern. There already exist theoretical and practical…
Elementary moves on lattice polytopes
Julien David, Lionel Pournin, Rado Rakotonarivo
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the -dimensional polytopes contained in and its edges connect any two polyto…
Parallel Galton Watson Process
Olivier Bodini, Camille Coti, Julien David
In this paper, we study a parallel version of Galton-Watson processes for the random generation of tree-shaped structures. Random trees are useful in many situations (testing, bina…
Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications
Olivier Bodini, David Julien, Marchal Philippe
In this paper, we redesign and simplify an algorithm due to Remy et al. for the generation of rooted planar trees that satisfies a given partition of degrees. This new version is n…
Asymptotic enumeration of Minimal Automata
Frederique Bassino, Julien David, Andrea Sportiello
We determine the asymptotic proportion of minimal automata, within n-state accessible deterministic complete automata over a k-letter alphabet, with the uniform distribution over t…
On the Average Complexity of Moore's State Minimization Algorithm
Frédérique Bassino, Julien David, Cyril Nicaud
We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moore's state…