Dynamical sources in information theory: A general analysis of trie structures J Clément, P Flajolet, B Vallée Algorithmica 29, 307-369, 2001 | 156 | 2001 |

The analysis of hybrid trie structures J Clément, P Flajolet, B Vallée Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms …, 1998 | 70 | 1998 |

The number of symbol comparisons in QuickSort and QuickSelect B Vallée, J Clément, JA Fill, P Flajolet Automata, Languages and Programming: 36th International Colloquium, ICALP …, 2009 | 51 | 2009 |

Exact p-value calculation for heterotypic clusters of regulatory motifs and its application in computational annotation of *cis*-regulatory modulesV Boeva, J Clément, M Régnier, MA Roytberg, VJ Makeev Algorithms for molecular biology 2, 1-15, 2007 | 47 | 2007 |

A multifractal mass transference principle for Gibbs measures with applications to dynamical Diophantine approximation AH Fan, J Schmeling, S Troubetzkoy Proceedings of the London Mathematical Society 107 (5), 1173-1219, 2013 | 46 | 2013 |

Reverse engineering prefix tables J Clément, M Crochemore, G Rindone 26th International Symposium on Theoretical Aspects of Computer Science, 2009 | 44 | 2009 |

The standard factorization of Lyndon words: an average point of view F Bassino, J Clément, C Nicaud Discrete Mathematics 290 (1), 1-25, 2005 | 33 | 2005 |

Counting occurrences for a finite set of words: combinatorial methods F Bassino, J Clément, P Nicodème ACM Transactions on Algorithms (TALG) 8 (3), 1-28, 2012 | 21 | 2012 |

Assessing the significance of sets of words V Boeva, J Clément, M Régnier, M Vandenbogaert Combinatorial Pattern Matching: 16th Annual Symposium, CPM 2005, Jeju Island …, 2005 | 17 | 2005 |

Constructions for clumps statistics F Bassino, J Clément, J Fayolle, P Nicodeme arXiv preprint arXiv:0804.3671, 2008 | 15 | 2008 |

Regularity of the Euclid Algorithm; application to the analysis of fast GCD Algorithms E Cesaratto, J Clément, B Daireaux, L Lhote, V Maume-Deschamps, ... Journal of Symbolic Computation 44 (7), 726-767, 2009 | 14 | 2009 |

Parsing with a finite dictionary J Clément, JP Duval, G Guaiana, D Perrin, G Rindone Theoretical Computer Science 340 (2), 432-442, 2005 | 14 | 2005 |

Towards a realistic analysis of some popular sorting algorithms J Clément, THN Thi, B Vallée Combinatorics, Probability and Computing 24 (1), 104-144, 2015 | 12 | 2015 |

Arbres digitaux et sources dynamiques J Clément These de doctorat, Université de Caen, 2000 | 12* | 2000 |

Counting occurrences for a finite set of words: an inclusion-exclusion approach F Bassino, J Clément, J Fayolle, P Nicodeme Discrete Mathematics and Theoretical Computer Science, 31-46, 2007 | 11 | 2007 |

Towards a realistic analysis of the QuickSelect algorithm J Clément, JA Fill, TH Nguyen Thi, B Vallée Theory of Computing Systems 58, 528-578, 2016 | 10 | 2016 |

A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms J Clément, THN Thi, B Vallée 30th International Symposium on Theoretical Aspects of Computer Science …, 2013 | 9 | 2013 |

Average depth in a binary search tree with repeated keys M Archibald, J Clément Discrete Mathematics and Theoretical Computer Science, 309-320, 2006 | 8 | 2006 |

Analysis of fast versions of the Euclid Algorithm E Cesaratto, J Clément, B Daireaux, L Lhote, V Maume-Deschamps, ... 2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and …, 2007 | 7 | 2007 |

Optimal prefix codes for some families of two-dimensional geometric distributions F Bassino, J Clément, G Seroussi, A Viola Data Compression Conference (DCC'06), 113-122, 2006 | 7 | 2006 |