Julien David

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 8

Top Venues

CoRR

OFC

GASCom

J. Comb. Theory, Ser. A

University of Paris-Est, France (PHD)

Education History

University of Paris-Est, France

PHD

Publications

Bruno Lavigne, Maël Le Monnier, Thierry Zami, Julien David, Stefan Weisser, Lutz Raddatz, Florian Pulka
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 (2024)
Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq
Approximate Cartesian Tree Matching: an Approach Using Swaps. CoRR (2023)
Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq
Approximate Cartesian Tree Matching: An Approach Using Swaps. SPIRE (2023)
Julien David, Lionel Pournin, Rado Rakotonarivo
Elementary moves on lattice polytopes. J. Comb. Theory, Ser. A 172 (2020)
Thierry Zami, Bruno Lavigne, Oriol Bertran-Pardo, Stefan Weisser, Julien David, Mael Le Monnier, Jean-Paul Faure
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 (2018)
Julien David, Lionel Pournin, Rado Rakotonarivo
A Markov chain for lattice polytopes. GASCom (2018)
Olivier Bodini, Camille Coti, Julien David
Parallel Galton Watson Process. CoRR (2016)
Olivier Bodini, Julien David, Philippe Marchal
Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications. CALDAM (2016)
Julien David, Loïck Lhote, Arnaud Mary, François Rioult
An average study of hypergraphs and their minimal transversals. Theor. Comput. Sci. 596 (2015)
Olivier Bodini, Julien David, Philippe Marchal
Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications. CoRR (2014)
Frédérique Bassino, Julien David, Andrea Sportiello
Asymptotic enumeration of Minimal Automata. STACS (2012)
Julien David
Average complexity of Moore's and Hopcroft's algorithms. Theor. Comput. Sci. 417 (2012)
Frédérique Bassino, Julien David, Cyril Nicaud
Average Case Analysis of Moore's State Minimization Algorithm. Algorithmica 63 (1-2) (2012)
Frédérique Bassino, Julien David, Andrea Sportiello
Asymptotic enumeration of Minimal Automata CoRR (2011)
Julien David
The Average Complexity of Moore's State Minimization Algorithm Is O(n log log n). MFCS (2010)
Frédérique Bassino, Julien David, Cyril Nicaud
On the Average Complexity of Moore's State Minimization Algorithm CoRR (2009)
Frédérique Bassino, Julien David, Cyril Nicaud
On the Average Complexity of Moore's State Minimization Algorithm. STACS (2009)
Frédérique Bassino, Julien David, Cyril Nicaud
: A Library to Randomly and Exhaustively Generate Automata. CIAA (2007)

Julien David.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Julien David