Publications

Publication list

2017

  • Representing prefix and border tables: results on enumeration.
    pdf Julien Clément, Laura Giambruno. Mathematical Structures in Computer Science 27(2): 257-276 (2017)

2016

  • TowardsTowards a Realistic Analysis of the QuickSelect Algorithm.
    pdf Julien Clément, James Allen Fill, Thu Hien Nguyen Thi, Brigitte Vallée. Theory Comput. Syst. 58(4): 528-578 (2016).

2015

  • Towards a Realistic Analysis of Some Popular Sorting Algorithms.
    pdf Julien Clément, Thu Hien Nguyen Thi, Brigitte Vallée. Combinatorics, Probability & Computing 24(1): 104-144 (2015).

2014

  • On the Number of Prefix and Border Tables.
    pdf Julien Clément, Laura Giambruno. LATIN 2014: 442-453.

2013

  • Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables.
    pdf 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.
    pdf 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.
    pdf Frédérique Bassino, Julien Clément, Pierre Nicodème. ACM Transactions on Algorithms 8(3): 31 (2012).

2011

2009

  • The Number of Symbol Comparisons in QuickSort and QuickSelect.
    pdf 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
    pdf 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
    pdf 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
    pdf 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
    pdf 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.
    pdf 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
    pdf 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
    pdf 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
    pdf 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
    pdf 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
    pdf 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
    pdf 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.
    pdf 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
    pdf 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
    pdf 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
    pdf 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
    pdf 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
    pdf 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).

    • Miscellaneous

    • Summary: Efficient computation of a class of continued fraction constants.
      Clément (Julien). - Summary of the talk by Loïck Lhote at the Algorithm Project (2003) [pdf].
    • Summary: Patterns in Trees.
      Clément (Julien), Durand (Marianne). - Summary of the talk by Thomas Klausner at the Algorithm Project (2002) [pdf].
    • PhD. Thesis: Arbres Digitaux et Sources Dynamiques
      Clément (Julien)  - Thèse de doctorat de l'université de caen (sept 2000). [pdf].
    • Summary: Asymptotics for sentences about structures with components
      Clément (Julien), Le Bars (Jean-Marie) - Summary of the talk by Alan Woods at the Algorithm Project (1998) [pdf].
    • Summary: Systèmes dynamiques et analyse en moyenne des arbres digitaux.
      Clément (Julien). - Summary of the talk by Brigitte Vallée at the Algorithm Project (1998) [pdf].
    • Summary: Some Properties of the Cantor Distribution
      Clément (Julien) - Summary of the talk by helmut Prodinger at the Algorithm Project (1996) [ps].
    • Mémoire de DEA: Analyse en moyenne des tries basés sur la numération en fraction continue
      Clément (Julien). - (à valeur essentiellement historique)  - Mémoire de DEA (1996) [pdf].