Filtrer vos résultats
- 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
35 résultats
|
|
|
triés par
|
|
|
Dichotomic Selection on Words: A Probabilistic Analysis30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), Jun 2019, Pisa, Italy. pp.19:1-19:19, ⟨10.4230/LIPIcs.CPM.2019.19⟩
Communication dans un congrès
hal-02152162v1
|
||
Exact P-value Calculation for Heterotypic Clusters of Regulatory Motifs and its Use in Computational Annotation of cis-Regulatory ModulesAlgorithms for Molecular Biology, 2007, 13 (2), http://www.almob.org/content/2/1/13
Article dans une revue
inria-00177609v1
|
|||
|
|
Towards a realistic analysis of the QuickSelect algorithmTheory of Computing Systems, 2016, 58 (4), pp.528-578. ⟨10.1007/s00224-015-9633-5⟩
Article dans une revue
hal-01138894v1
|
||
|
|
Entropy for dynamical sourcesProceedings of IWAP 2008, Jul 2009, Compiègne, France
Communication dans un congrès
hal-01082045v1
|
||
|
|
Representing prefix and border tables: results on enumerationMathematical Structures in Computer Science, 2017, 27 (02), pp.257 - 276. ⟨10.1017/S0960129515000146⟩
Article dans une revue
hal-01708989v1
|
||
|
|
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⟩
Article dans une revue
hal-00504022v1
|
||
|
|
Optimal prefix codes for some families of two-dimensional geometric distributionsData Compression Conference (DCC'06), 2006, United States. pp.113-122
Communication dans un congrès
hal-00619867v1
|
||
|
|
Singularity of optimal prefix codes for pairs of geometrically-distributed random variables.2011
Pré-publication, Document de travail
hal-00569199v1
|
||
|
|
The Number of Symbol Comparisons in QuickSort and QuickSelect36th International Colloquium on Automata, Languages and Programming, Jul 2009, Rhodes, Greece. pp.750 - 763, ⟨10.1007/978-3-642-02927-1_62⟩
Communication dans un congrès
hal-01082394v1
|
||
|
|
Algorithmes, mots et textes aléatoiresAlgorithme et structure de données [cs.DS]. Université de Caen, 2011
HDR
tel-00913127v1
|
||
On the Number of Prefix and Border TablesLATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Mar 2014, Montevideo, Uruguay. pp.442-453, ⟨10.1007/978-3-642-54423-1_39⟩
Communication dans un congrès
hal-00982224v1
|
|||
On the complexity of strings14th Italian Conference on Theoretical Computer Science, Sep 2013, Palerme, Italy
Communication dans un congrès
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
Communication dans un congrès
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⟩
Article dans une revue
hal-00619337v1
|
||
|
|
Arbres pour l'algorithmique83, 2018, Mathématiques et Applications, 978-3-319-93724-3. ⟨10.1007/978-3-319-93725-0⟩
Ouvrages
hal-01708981v3
|
||
|
|
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⟩
Communication dans un congrès
hal-02632657v1
|
||
|
|
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⟩
Communication dans un congrès
hal-03871300v1
|
||
|
|
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⟩
Communication dans un congrès
hal-01184700v1
|
||
|
|
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
Communication dans un congrès
hal-00619865v1
|
||
|
|
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⟩
Article dans une revue
hal-00511248v1
|
||
|
|
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⟩
Article dans une revue
hal-01103998v1
|
||
|
|
Dynamical Sources in Information Theory : A General Analysis of Trie Structures[Research Report] RR-3645, INRIA. 1999
Rapport
inria-00073027v1
|
||
|
|
The Analysis of Hybrid Trie Structures[Research Report] RR-3295, INRIA. 1997
Rapport
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
Communication dans un congrès
hal-01084082v1
|
|||
|
|
Exemples d'analyse d'algorithmes: calculs de PGCD et algorithmes de tri et de rechercheInformatique Mathématique: Une photographie en 2014, 2014, 9782354122287
Chapitre d'ouvrage
hal-01087191v1
|
||
|
|
Counting occurrences for a finite set of words: combinatorial methodsACM Transactions on Algorithms, 2012, 8, pp.31:1--31:28. ⟨10.1145/2229163.2229175⟩
Article dans une revue
hal-00452694v2
|
||
|
|
Reverse Engineering Prefix Tables26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.289-300
Communication dans un congrès
inria-00359304v1
|
||
|
|
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
Communication dans un congrès
hal-00619866v1
|
||
|
|
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⟩
Communication dans un congrès
hal-00452702v2
|
||
|
|
Dynamical sources in information theory: a general analysis of trie structuresAlgorithmica, 2001, 29 (1-2), pp.307-369. ⟨10.1007/BF02679623⟩
Article dans une revue
hal-00619544v1
|
- 1
- 2