default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulien David
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]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: 1-3- 2023
- [c8]Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq:
Approximate Cartesian Tree Matching: An Approach Using Swaps. SPIRE 2023: 49-61 - [i5]Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq:
Approximate Cartesian Tree Matching: an Approach Using Swaps. CoRR abs/2306.16065 (2023) - 2020
- [j4]Julien David, Lionel Pournin
, Rado Rakotonarivo:
Elementary moves on lattice polytopes. J. Comb. Theory A 172: 105200 (2020)
2010 – 2019
- 2018
- [c7]Julien David, Lionel Pournin, Rado Rakotonarivo:
A Markov chain for lattice polytopes. GASCom 2018: 132-139 - [c6]Thierry Zami, Bruno Lavigne, Oriol Bertran-Pardo, Stefan Weisser, Julien David, Maël 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: 1-3 - 2016
- [c5]Olivier Bodini, Julien David, Philippe Marchal:
Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications. CALDAM 2016: 97-114 - [i4]Olivier Bodini, Camille Coti, Julien David:
Parallel Galton Watson Process. CoRR abs/1606.06629 (2016) - 2015
- [j3]Julien David, Loïck Lhote, Arnaud Mary, François Rioult:
An average study of hypergraphs and their minimal transversals. Theor. Comput. Sci. 596: 124-141 (2015) - 2014
- [i3]Olivier Bodini, Julien David, Philippe Marchal:
Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications. CoRR abs/1401.4712 (2014) - 2012
- [j2]Frédérique Bassino, Julien David, Cyril Nicaud:
Average Case Analysis of Moore's State Minimization Algorithm. Algorithmica 63(1-2): 509-531 (2012) - [j1]Julien David:
Average complexity of Moore's and Hopcroft's algorithms. Theor. Comput. Sci. 417: 50-65 (2012) - [c4]Frédérique Bassino, Julien David, Andrea Sportiello:
Asymptotic enumeration of Minimal Automata. STACS 2012: 88-99 - 2011
- [i2]Frédérique Bassino, Julien David, Andrea Sportiello:
Asymptotic enumeration of Minimal Automata. CoRR abs/1109.5683 (2011) - 2010
- [b1]Julien David:
Génération aléatoire d'automates et analyse d'algorithmes de minimisation. (Random generation of automata and analysis of their state minimization algorithms). University of Paris-Est, France, 2010 - [c3]Julien David:
The Average Complexity of Moore's State Minimization Algorithm Is O(n log log n). MFCS 2010: 318-329
2000 – 2009
- 2009
- [c2]Frédérique Bassino, Julien David, Cyril Nicaud:
On the Average Complexity of Moore's State Minimization Algorithm. STACS 2009: 123-134 - [i1]Frédérique Bassino, Julien David, Cyril Nicaud:
On the Average Complexity of Moore's State Minimization Algorithm. CoRR abs/0902.1048 (2009) - 2007
- [c1]Frédérique Bassino, Julien David, Cyril Nicaud:
: A Library to Randomly and Exhaustively Generate Automata. CIAA 2007: 303-305
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
