Julien David

24 papers A 2B 2C 2Journal 13Unranked 4
YearRankTypeTitle / Venue / Authors
2026 B conf
Cartesian Forest Matching.
WALCOM
Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq
2026 J jnl
On the average-case complexity of Berge algorithm.
Theor. Comput. Sci.
Julien David, Mostafa Gholami, Loïck Lhote
2026 J jnl
Random generation of source vectors with a fixed preponderant property.
Theor. Comput. Sci.
Julien David
2025 J jnl
Approximate Cartesian Tree Matching with One Difference.
CoRR
Bastien Auvray, Julien David, Samah Ghazawi, Richard Groult, Gad M. Landau, Thierry Lecroq
2025 J jnl
Cartesian Forest Matching.
CoRR
Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq
2024 — conf
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.
OFC
Bruno Lavigne, Maël Le Monnier, Thierry Zami, Julien David, Stefan Weisser, Lutz Raddatz, Florian Pulka
2023 C conf
Approximate Cartesian Tree Matching: An Approach Using Swaps.
SPIRE
Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq
2023 J jnl
Approximate Cartesian Tree Matching: an Approach Using Swaps.
CoRR
Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq
2020 J jnl
Elementary moves on lattice polytopes.
J. Comb. Theory A
Julien David, Lionel Pournin, Rado Rakotonarivo
2018 — conf
31.2-Tb/s Real Time Bidirectional Transmission of 78×400 Gb/s Interleaved Channels over C Band of One 90-km SMF Span.
OFC
Thierry Zami, Bruno Lavigne, Oriol Bertran-Pardo, Stefan Weisser, Julien David, Maël Le Monnier, Jean-Paul Faure
2018 — conf
A Markov chain for lattice polytopes.
GASCom
Julien David, Lionel Pournin, Rado Rakotonarivo
2016 J jnl
Parallel Galton Watson Process.
CoRR
Olivier Bodini, Camille Coti, Julien David
2016 — conf
Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications.
CALDAM
Olivier Bodini, Julien David, Philippe Marchal
2015 J jnl
An average study of hypergraphs and their minimal transversals.
Theor. Comput. Sci.
Julien David, Loïck Lhote, Arnaud Mary, François Rioult
2014 J jnl
Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications.
CoRR
Olivier Bodini, Julien David, Philippe Marchal
2012 A conf
Asymptotic enumeration of Minimal Automata.
STACS
Frédérique Bassino, Julien David, Andrea Sportiello
2012 J jnl
Average Case Analysis of Moore's State Minimization Algorithm.
Algorithmica
Frédérique Bassino, Julien David, Cyril Nicaud
2012 J jnl
Average complexity of Moore's and Hopcroft's algorithms.
Theor. Comput. Sci.
Julien David
2011 J jnl
Asymptotic enumeration of Minimal Automata
CoRR
Frédérique Bassino, Julien David, Andrea Sportiello
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 B conf
The Average Complexity of Moore's State Minimization Algorithm Is O(n log log n).
MFCS
Julien David
2009 J jnl
On the Average Complexity of Moore's State Minimization Algorithm
CoRR
Frédérique Bassino, Julien David, Cyril Nicaud
2009 A conf
On the Average Complexity of Moore's State Minimization Algorithm.
STACS
Frédérique Bassino, Julien David, Cyril Nicaud
2007 C conf
: A Library to Randomly and Exhaustively Generate Automata.
CIAA
Frédérique Bassino, Julien David, Cyril Nicaud