Filtrer vos résultats
- 47
- 16
- 28
- 26
- 3
- 2
- 2
- 1
- 1
- 50
- 29
- 1
- 3
- 1
- 4
- 2
- 2
- 2
- 1
- 2
- 6
- 2
- 5
- 2
- 5
- 3
- 3
- 3
- 3
- 1
- 1
- 2
- 1
- 2
- 1
- 3
- 2
- 60
- 3
- 43
- 42
- 13
- 9
- 8
- 8
- 6
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 63
- 22
- 12
- 11
- 10
- 8
- 6
- 6
- 6
- 5
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 2
- 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
63 résultats
|
|
Séries rationnelles et distributions de longueursCombinatoire [math.CO]. Université de Marne la Vallée, 1996. Français. ⟨NNT : ⟩
Thèse
tel-00719366v1
|
||
|
|
Enumeration and random generation of accessible automataTheoretical Computer Science, 2007, 381, pp.86-104
Article dans une revue
hal-00459712v1
|
||
|
|
Random generation of possibly incomplete deterministic automata.Génération Aléatoire de Structures COMbinatoires, 2008, Italy. pp.31-40
Communication dans un congrès
hal-00452754v1
|
||
|
|
REGAL: a library to randomly and exhaustively generate automata12th International Conference on Implementation and Application of Automata (CIAA'07), Jul 2007, Prague, Czech Republic. pp.303-305., ⟨10.1007/978-3-540-76336-9_28⟩
Communication dans un congrès
hal-00459643v1
|
||
|
|
$\beta$-expansions for cubic Pisot numbers5th Latin American Theoretical INformatics (LATIN'2002), 2002, United States. pp.141-152
Communication dans un congrès
hal-00619858v1
|
||
|
|
Linear-sized independent sets in random cographs and increasing subsequences in separable permutationsCombinatorial Theory, 2022, 2 (3), https://escholarship.org/uc/item/23340676. ⟨10.5070/C62359179⟩
Article dans une revue
hal-03366684v1
|
||
|
|
Random cographs: Brownian graphon limit and asymptotic degree distributionRandom Structures and Algorithms, 2022, 60 (2), pp.166-200. ⟨10.1002/rsa.21033⟩
Article dans une revue
hal-02412976v1
|
||
|
|
Accessible and Deterministic Automata: Enumeration and Boltzmann SamplersFourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.151-160, ⟨10.46298/dmtcs.3499⟩
Communication dans un congrès
hal-00619870v2
|
||
|
|
Combinatorial specification of permutation classes24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), Jul 2012, Nagoya, Japan. pp.781 - 792, ⟨10.46298/dmtcs.3082⟩
Communication dans un congrès
hal-00685023v1
|
||
|
|
Generic properties of subgroups of free groups and finite presentationsDelaram Kahrobaei, Bren Cavallo, David Garber. Algebra and Computer Science, 677, American Mathematical Society, pp.1-44, 2016, Contemporary Mathematics, 978-1-4704-2303-2
Chapitre d'ouvrage
hal-01171484v2
|
||
|
|
Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality21st Annual Symposium on Combinatorial Pattern Matching (CPM 2010), Jun 2010, United States. pp.275-287
Communication dans un congrès
hal-00450674v2
|
||
Enumerative sequences of leaves in rational treesInternational Colloquium on Automata, Languages and Programming (ICALP 1997), 1997, Italy. pp.76-86
Communication dans un congrès
hal-00619864v1
|
|||
|
|
Statistics of subgroups of the modular groupInternational Journal of Algebra and Computation, 2021, 31 (08), pp.1691-1751. ⟨10.1142/S0218196721500624⟩
Article dans une revue
hal-03507020v1
|
||
|
|
Random presentations and random subgroups: a surveyFrédérique Bassino, Ilya Kapovich, Markus Lohrey, Alexei Miasnikov, Cyril Nicaud, Andrey Nikolaev, Igor Rivin, Vladimir Shpilrain, Alexander Ushakov and Pascal Weil. Complexity and Randomness in Group Theory - GAGTA Book 1, de Gruyter, 2020, 978-3-11-066491-1
Chapitre d'ouvrage
hal-01456207v2
|
||
|
|
Enumeration of Pin-PermutationsThe Electronic Journal of Combinatorics, 2011, 18 (1), pp.P57
Article dans une revue
hal-00348664v2
|
||
|
|
The complexity of the Approximate Multiple Pattern Matching Problem for random stringsAofA 2020, Jun 2020, Klagenfurt, Austria. ⟨10.4230/LIPIcs.AOFA.2020.24⟩
Communication dans un congrès
hal-03214615v1
|
||
|
|
Automata for arithmetic Meyer setsLATIN 04, 2004, Buenos-Aires, Argentina. pp.252-261, ⟨10.1007/978-3-540-24698-5_29⟩
Communication dans un congrès
hal-00159713v1
|
||
|
|
Average Case Analysis of Moore's State Minimization Algorithm.Algorithmica, 2012, 63 (1-2), pp.509-531. ⟨10.1007/s00453-011-9557-7⟩
Article dans une revue
hal-00452749v1
|
||
|
|
An algorithm computing combinatorial specifications of permutation classesDiscrete Applied Mathematics, 2017, 224, pp.16-44. ⟨10.1016/j.dam.2017.02.013⟩
Article dans une revue
hal-01175234v1
|
||
|
|
An algorithm for deciding the finiteness of the number of simple permutations in permutation classesAdvances in Applied Mathematics, 2015, 64, pp.124 - 200. ⟨10.1016/j.aam.2014.12.001⟩
Article dans une revue
hal-01818308v1
|
||
|
|
Linear-time exact sampling of sum-constrained random variablesGASCom 2018, Jun 2018, Athens, Greece
Communication dans un congrès
hal-03214069v1
|
||
|
|
Asymptotic enumeration of Minimal AutomataSTACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.88-99
Communication dans un congrès
hal-00678203v1
|
||
|
|
Deciding the finiteness of simple permutations contained in a wreath-closed class is polynomialPermutation Patterns 2009 (PP 2009), Jul 2009, Florence, Italy. pp.13-20
Communication dans un congrès
hal-00459647v1
|
||
|
|
Random generation of finitely generated subgroups of a free groupInternational Journal of Algebra and Computation, 2008, 18 (1), pp.375-405. ⟨10.1142/S0218196708004482⟩
Article dans une revue
hal-00164584v1
|
||
|
|
Super-state automata and rational trees3rd Latin American Theoretical INformatics (LATIN'98), Apr 1998, Campinas, Brazil. pp.42-52
Communication dans un congrès
hal-00619862v1
|
||
Generating functions of circular codesAdvances in Applied Mathematics, 1999, 22 (1), pp.1-24
Article dans une revue
hal-00619331v1
|
|||
Nonnegative companion matrices and star-height of N-rational seriesTheoretical Computer Science, 1997, 180 (1-2), pp.61-80
Article dans une revue
hal-00619332v1
|
|||
|
|
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
|
||
|
|
The complexity of the Multiple Pattern Matching Problem for random stringsMarkus Nebel; Stephan Wagner. 2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), Society for Industrial and Applied Mathematics, pp.40-53, 2017, 9781611975062. ⟨10.1137/1.9781611975062.5⟩
Chapitre d'ouvrage
hal-03505281v1
|
||
|
|
Optimal prefix codes for pairs of geometrically-distributed random variablesIEEE International Symposium on Information Theory (ISIT'06), 2006, United States. pp.2667 - 2671
Communication dans un congrès
hal-00619869v1
|