The Analysis of Hybrid Trie Structures. - Julien Clément 001; Philippe Flajolet; Brigitte Vallée (SODA, 1998)

Arbres digitaux et sources dynamiques. (Digital search trees and dynamical sources). - Julien Clément 001 (2000)

Dynamical Sources in Information Theory: A General Analysis of Trie Structures. - Julien Clément 001; Philippe Flajolet; Brigitte Vallée (Algorithmica, 2001)

The Average Lengths of the Factors of the Standard Factorization of Lyndon Words. - Frédérique Bassino; Julien Clément 001; Cyril Nicaud (Developments in Language Theory, 2002)

Lyndon words with a fixed standard right factor. - Frédérique Bassino; Julien Clément 001; Cyril Nicaud (SODA, 2004)

Assessing the Significance of Sets of Words. - Valentina Boeva; Julien Clément 001; Mireille Régnier; Mathias Vandenbogaert (CPM, 2005)

The standard factorization of Lyndon words: an average point of view. - Frédérique Bassino; Julien Clément 001; Cyril Nicaud (Discret. Math., 2005)

Parsing with a finite dictionary. - Julien Clément 001; Jean-Pierre Duval; Giovanna Guaiana; Dominique Perrin; Giuseppina Rindone (Theor. Comput. Sci., 2005)

Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions. - Frédérique Bassino; Julien Clément 001; Gadiel Seroussi; Alfredo Viola (DCC, 2006)

Exact p-value calculation for heterotypic clusters of regulatory motifs and its application in computational annotation of cis-regulatory modules. - Valentina Boeva; Julien Clément 001; Mireille Régnier; Mikhail A. Roytberg; Vsevolod J. Makeev (Algorithms Mol. Biol., 2007)

Constructions for Clumps Statistics - Frédérique Bassino; Julien Clément 001; Julien Fayolle; Pierre Nicodème (CoRR, 2008)

The Number of Symbol Comparisons in QuickSort and QuickSelect. - Brigitte Vallée; Julien Clément 001; James Allen Fill; Philippe Flajolet (ICALP (1), 2009)

Reverse Engineering Prefix Tables. - Julien Clément 001; Maxime Crochemore; Giuseppina Rindone (STACS, 2009)

Regularity of the Euclid Algorithm; application to the analysis of fast GCD Algorithms. - Eda Cesaratto; Julien Clément 001; Benoit Daireaux; Loïck Lhote; Véronique Maume-Deschamps; Brigitte Vallée (J. Symb. Comput., 2009)

Algorithmes, mots et textes aléatoires. (Algorithms, words and random texts). - Julien Clément 001 (2011)

Guidelines for the Verification of Population Protocols. - Julien Clément 001; Carole Delporte-Gallet; Hugues Fauconnier; Mihaela Sighireanu (ICDCS, 2011)

Counting occurrences for a finite set of words: Combinatorial methods. - Frédérique Bassino; Julien Clément 001; Pierre Nicodème (ACM Trans. Algorithms, 2012)

A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms. - Julien Clément 001; Thu Hien Nguyen Thi; Brigitte Vallée (STACS, 2013)

Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables. - Frédérique Bassino; Julien Clément 001; Gadiel Seroussi; Alfredo Viola (IEEE Trans. Inf. Theory, 2013)

On the Number of Prefix and Border Tables. - Julien Clément 001; Laura Giambruno (LATIN, 2014)

Towards a Realistic Analysis of Some Popular Sorting Algorithms. - Julien Clément 001; Thu Hien Nguyen Thi; Brigitte Vallée (Comb. Probab. Comput., 2015)

Towards a Realistic Analysis of the QuickSelect Algorithm. - Julien Clément 001; James Allen Fill; Thu Hien Nguyen Thi; Brigitte Vallée (Theory Comput. Syst., 2016)

Representing prefix and border tables: results on enumeration. - Julien Clément 001; Laura Giambruno (Math. Struct. Comput. Sci., 2017)

Dichotomic Selection on Words: A Probabilistic Analysis. - Ali Akhavi; Julien Clément 001; Dimitri Darthenay; Loïck Lhote; Brigitte Vallée (CPM, 2019)

Hydra: Cancer Detection Leveraging Multiple Heads and Heterogeneous Datasets. - Giuseppe Cuccu; Johan Jobin; Julien Clément 001; Akansha Bhardwaj; Carolin Reischauer; Harriet Thöny; Philippe Cudré-Mauroux (IEEE BigData, 2020)

Binary Decision Diagrams: From Tree Compaction to Sampling. - Julien Clément 001; Antoine Genitrini (LATIN, 2020)

Combinatorics of Reduced Ordered Binary Decision Diagrams: Application to uniform random sampling. - Julien Clément 001; Antoine Genitrini (CoRR, 2022)

An Iterative Approach for Counting Reduced Ordered Binary Decision Diagrams. - Julien Clément 001; Antoine Genitrini (MFCS, 2023)