Julien Clément

2013

• Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables.
  Frédérique Bassino, Julien Clément, Gadiel Seroussi, Alfredo Viola. IEEE Transactions on Information Theory 59(4): 2375-2395 (2013).
• A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms.
  Julien Clément, Thu Hien Nguyen Thi, Brigitte Vallée. STACS 2013: 598-609.

2012

• Counting occurrences for a finite set of words: combinatorial methods.
  Frédérique Bassino, Julien Clément, Pierre Nicodème. ACM Transactions on Algorithms 8(3): 31 (2012).

2011

• Algorithmes, mots et textes aléatoires.
  Julien Clément. (74 pages, habilitation à diriger des recherches, université de Caen-Basse-Normandie, décembre 2011).

2009

• The Number of Symbol Comparisons in QuickSort and QuickSelect.
  Brigitte Vallée, Julien Clément, James Allen Fill, Philippe Flajolet. S. Albers et al. (Eds.): ICALP 2009, Part I, LNCS 5555, pp. 750-763, 2009.
• Regularity of the Euclid Algorithm. Application to the analysis of fast gcd Algorithms
  Cesaratto (Eda), Clément (Julien), Daireaux (Benoît), Lhote (Loïck), Maume-Deschamps (Véronique) and Vallée (Brigitte), in Journal of Symbolic Computation 44(7): 726-767 (2009).
• Reverse Engineering Prefix Tables
  Julien Clément, Maxime Crochemore, Giuseppina Rindone. Symposium on Theoretical Aspects of Computer Science (STACS) 2009 (Freiburg), pp. 289-300.

2008

• Constructions for Clumps Statistics
  Bassino (Frédérique), Clément (Julien), Fayolle (Julien), and Nicodème (Pierre), Fifth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities (2008), Blaubeuren. DMTCS proc. AI, 2008, 179-194.
• Entropy for dynamical sources
  Clément (Julien), Lhote (Loïck) and Vallée (Brigitte), Proceedings of the International Workshop on Applied Probability (IWAP), 2008.

2007

Exact p-value calculation for heterotypic clusters of regulatory motifs and its application in computational annotation of cis-regulatory modules.
V. Boeva, J. Clement , M. Regnier, M.A. Roytberg, V.J. Makeev. Algorithms for Molecular Biology, 2007, 2:13.

Counting occurrences for a finite set of words: an inclusion-exclusion approach
Bassino (Frédérique), Clément (Julien), Fayolle (Julien), and Nicodème (Pierre). 2007 Conference on Analysis of Algorithms, (AofA'07) DMTCS proc. AH, 2007, pp. 29-44.

Analysis of fast versions of the Euclid algorithm
Cesaratto (Eda), Clément (Julien), Daireaux (Benoît), Lhote (Loïck), Maume-Deschamps (Véronique) and Vallée (Brigitte), in ANALCO 2007: 3rd Workshop on Analytic Algorithmics and Combinatorics (2007), New Orleans.

2006

Average depth in a binary search tree with repeated keys
Archibald (Margaret), Clément (Julien), in Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, Nancy. DMTCS proc. AG, 2006, pp. 309-320.

Optimal prefix codes for pairs of geometrically-distributed random variables
Bassino (Frédérique), Clément (Julien), Seroussi (Gadiel) and Viola (Alfredo), in 2006 IEEE International Symposium on Information Theory (Seattle).

Optimal prefix codes for some families of two-dimensional geometric distributions
Bassino (Frédérique), Clément (Julien), Seroussi (Gadiel) and Viola (Alfredo), in Data Compression Conference (DCC) 2006, IEEE Computer Society Press: 113-122 (2006).

2005

Parsing with a finite dictionary
Clément (Julien), Duval (Jean-Pierre), Guaiana (Giovanna), Perrin (Dominique) and Rindone (Giuseppina), Theor. Comput. Sci. 340(1): 432-442 (2005).

Assessing the significance of Sets of Words.
Boeva (Valentina), Clément (Julien), Régnier (Mireille), and Vandenbogaert (Mathias), CPM 2005: 358-370.[link]

The Standard Factorization of Lyndon Words: an Average Point of View
Bassino (Frédérique), Clément (Julien) and Nicaud (Cyril), (2005) - Discrete Math. (290). Elsevier, pp. 1-25 (Preliminary version).

2004

Lyndon words with a fixed standard right factor
Bassino (Frédérique), Clément (Julien), Nicaud (Cyril), in Proceding of the fifteenth annual ACM-SIAM Symposium on Discrete Algorithms (Philadelphia, 2004), pp. 646-647 (Preliminary version).

2003

The average lengths of the factors of the standard factorization of Lyndon words
Bassino (Frédérique), Clément (Julien) and Nicaud (Cyril), in DLT'02, volume 2450 in LNCS, p. 307-318, Springer, 2003 (Preliminary version)

2001

Dynamical Sources in Information Theory: A General Analysis of Trie Structures
Clément (Julien), Flajolet (Philippe), Vallée (Brigitte) - In Algorithmica (2001) 29:307-369. Springer-Verlag. (INRIA Research report version, 61 pages).

1998

The Analysis of Hybrid Trie Structures
Clément (Julien), Flajolet (Philippe), and Vallée (Brigitte). - In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (Philadelphia, 1998), pp. 531-539. SIAM Press, Philadelphia, PA, 1998. (INRIA Research report version).