Julien Clément

Orcid: 0000-0001-8365-3899

Affiliations:
  • Université de Caen Basse-Normandie, GREYC, France


According to our database1, Julien Clément authored at least 28 papers between 1998 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
An Iterative Approach for Counting Reduced Ordered Binary Decision Diagrams.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022
Combinatorics of Reduced Ordered Binary Decision Diagrams: Application to uniform random sampling.
CoRR, 2022

2020
Binary Decision Diagrams: From Tree Compaction to Sampling.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Hydra: Cancer Detection Leveraging Multiple Heads and Heterogeneous Datasets.
Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

2019
Dichotomic Selection on Words: A Probabilistic Analysis.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2017
Representing prefix and border tables: results on enumeration.
Math. Struct. Comput. Sci., 2017

2016
Towards a Realistic Analysis of the QuickSelect Algorithm.
Theory Comput. Syst., 2016

2015
Towards a Realistic Analysis of Some Popular Sorting Algorithms.
Comb. Probab. Comput., 2015

2014
On the Number of Prefix and Border Tables.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013
Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables.
IEEE Trans. Inf. Theory, 2013

A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012
Counting occurrences for a finite set of words: Combinatorial methods.
ACM Trans. Algorithms, 2012

2011
Guidelines for the Verification of Population Protocols.
Proceedings of the 2011 International Conference on Distributed Computing Systems, 2011

Algorithmes, mots et textes aléatoires. (Algorithms, words and random texts).
, 2011

2009
Regularity of the Euclid Algorithm; application to the analysis of fast GCD Algorithms.
J. Symb. Comput., 2009

Reverse Engineering Prefix Tables.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

The Number of Symbol Comparisons in QuickSort and QuickSelect.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008
Constructions for Clumps Statistics
CoRR, 2008

2007
Exact p-value calculation for heterotypic clusters of regulatory motifs and its application in computational annotation of <i>cis</i>-regulatory modules.
Algorithms Mol. Biol., 2007

2006
Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions.
Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

2005
Parsing with a finite dictionary.
Theor. Comput. Sci., 2005

The standard factorization of Lyndon words: an average point of view.
Discret. Math., 2005

Assessing the Significance of Sets of Words.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004
Lyndon words with a fixed standard right factor.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2002
The Average Lengths of the Factors of the Standard Factorization of Lyndon Words.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001
Dynamical Sources in Information Theory: A General Analysis of Trie Structures.
Algorithmica, 2001

2000
Arbres digitaux et sources dynamiques. (Digital search trees and dynamical sources).
PhD thesis, 2000

1998
The Analysis of Hybrid Trie Structures.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998


  Loading...