Filter your results
- 28
- 7
- 18
- 10
- 2
- 2
- 1
- 1
- 1
- 2
- 34
- 13
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 4
- 1
- 3
- 4
- 2
- 3
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 32
- 3
- 31
- 9
- 6
- 5
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 35
- 12
- 10
- 5
- 4
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
|
sorted by
|
|
Arbres pour l'algorithmique83, 2018, Mathématiques et Applications, 978-3-319-93724-3. ⟨10.1007/978-3-319-93725-0⟩
Books
hal-01708981v3
|
||
On the complexity of strings14th Italian Conference on Theoretical Computer Science, Sep 2013, Palerme, Italy
Conference papers
hal-01086520v1
|
|||
|
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Feb 2013, Kiel, Germany
Conference papers
hal-01086576v1
|
||
|
The Standard Factorization of Lyndon Words: an Average Point of ViewDiscrete Mathematics, 2005, 290 (1), pp.1-25. ⟨10.1016/j.disc.2004.11.002⟩
Journal articles
hal-00619337v1
|
||
|
Binary Decision Diagrams: from Tree Compaction to Sampling14th Latin American Theoretical Informatics Symposium, May 2020, Sao Polo, Brazil. ⟨10.1007/978-3-030-61792-9_45⟩
Conference papers
hal-02632657v1
|
||
|
Optimal prefix codes for pairs of geometrically-distributed random variablesIEEE Transactions on Information Theory, 2013, 59 (4), pp.2375 - 2395. ⟨10.1109/TIT.2012.2236915⟩
Journal articles
hal-00511248v1
|
||
|
An Iterative Approach for Counting Reduced Ordered Binary Decision Diagrams48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), Aug 2023, Bordeaux, France. pp.36:1--36:15, ⟨10.4230/LIPIcs.MFCS.2023.36⟩
Conference papers
hal-03871300v1
|
||
|
Towards a Realistic Analysis of Some Popular Sorting AlgorithmsCombinatorics, Probability and Computing, 2015, (Honouring the Memory of Philippe Flajolet - Part 3, 24 (01), pp.104-144. ⟨10.1017/S0963548314000649⟩
Journal articles
hal-01103998v1
|
||
|
The average lengths of the factors of the standard factorization of Lyndon words6th International Conference on Developments in Language Theory (DLT 2002), Sep 2003, Kyoto, Japan. pp.307-318
Conference papers
hal-00619865v1
|
||
|
Average depth in a binary search tree with repeated keysFourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.309-320, ⟨10.46298/dmtcs.3496⟩
Conference papers
hal-01184700v1
|
||
|
Regularity of the Euclid Algorithm, Application to the analysis of fast GCD AlgorithmsJournal of Symbolic Computation, 2009, 44 (7), pp.726. ⟨10.1016/j.jsc.2008.04.018⟩
Journal articles
hal-00504022v1
|
||
|
Singularity of optimal prefix codes for pairs of geometrically-distributed random variables.2011
Preprints, Working Papers, ...
hal-00569199v1
|
||
|
Optimal prefix codes for some families of two-dimensional geometric distributionsData Compression Conference (DCC'06), 2006, United States. pp.113-122
Conference papers
hal-00619867v1
|
||
|
Dynamical Sources in Information Theory : A General Analysis of Trie Structures[Research Report] RR-3645, INRIA. 1999
Reports
inria-00073027v1
|
||
|
The Analysis of Hybrid Trie Structures[Research Report] RR-3295, INRIA. 1997
Reports
inria-00073393v1
|
||
Words occurrences in random textsAofA'11, 22th International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms,, 2011, Będlewo, Poland
Conference papers
hal-01084082v1
|
|||
|
Counting occurrences for a finite set of words: combinatorial methodsACM Transactions on Algorithms, 2012, 8, pp.31:1--31:28. ⟨10.1145/2229163.2229175⟩
Journal articles
hal-00452694v2
|
||
|
Exemples d'analyse d'algorithmes: calculs de PGCD et algorithmes de tri et de rechercheInformatique Mathématique: Une photographie en 2014, 2014, 9782354122287
Book sections
hal-01087191v1
|
||
|
Counting occurrences for a finite set of words: an inclusion-exclusion approach2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.31-46, ⟨10.46298/dmtcs.3543⟩
Conference papers
hal-00452702v2
|
||
|
Lyndon words with a fixed standard right factor15th ACM-SIAM Annual Symposium on Discrete Algorithms (SODA 2004), Jan 2004, New Orleans, Louisiana, United States. pp.646-647
Conference papers
hal-00619866v1
|
||
|
Reverse Engineering Prefix Tables26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.289-300
Conference papers
inria-00359304v1
|
||
|
Analysis of fast versions of the euclid algorithm2008
Preprints, Working Papers, ...
hal-00211424v1
|
||
|
Exact p-value calculation for heterotypic clusters of regulatory motifs and its application in computational annotation of cis-regulatory modulesAlgorithms for Molecular Biology, 2007, 2 (1), pp.13. ⟨10.1186/1748-7188-2-13⟩
Journal articles
hal-00784463v1
|
||
|
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 2013, Kiel, Germany. pp.598--609, ⟨10.4230/LIPIcs.STACS.2013.598⟩
Conference papers
hal-00913309v1
|
||
|
Dynamical sources in information theory: a general analysis of trie structuresAlgorithmica, 2001, 29 (1-2), pp.307-369. ⟨10.1007/BF02679623⟩
Journal articles
hal-00619544v1
|
||
|
Optimal prefix codes for pairs of geometrically-distributed random variablesIEEE International Symposium on Information Theory (ISIT'06), 2006, United States. pp.2667 - 2671
Conference papers
hal-00619869v1
|
||
|
Constructions for Clumps Statistics.5th International Colloquium on Mathematics and Computer Science (MathInfo'08), Sep 2008, Blaubeuren, Germany. pp.183-198., ⟨10.46298/dmtcs.3563⟩
Conference papers
hal-00452701v2
|
||
|
Representing prefix and border tables: results on enumerationMathematical Structures in Computer Science, 2017, 27 (02), pp.257 - 276. ⟨10.1017/S0960129515000146⟩
Journal articles
hal-01708989v1
|
||
|
Entropy for dynamical sourcesProceedings of IWAP 2008, Jul 2009, Compiègne, France
Conference papers
hal-01082045v1
|
||
|
Towards a realistic analysis of the QuickSelect algorithmTheory of Computing Systems, 2016, 58 (4), pp.528-578. ⟨10.1007/s00224-015-9633-5⟩
Journal articles
hal-01138894v1
|
- 1
- 2