| Publication | Date of Publication | Type |
|---|
Random generation of subgroups of the modular group with a fixed isomorphism type
The Electronic Journal of Combinatorics | 2024-11-09 | Paper |
Linear-time exact sampling of sum-constrained random variables
| 2024-10-31 | Paper |
Silhouettes and generic properties of subgroups of the modular group
| 2023-11-14 | Paper |
Random generation of subgroups of the modular group with a fixed isomorphism type
| 2023-10-29 | Paper |
Random cographs: Brownian graphon limit and asymptotic degree distribution
Random Structures \& Algorithms | 2023-10-12 | Paper |
scientific article; zbMATH DE number 7651042 (Why is no real title available?)
| 2023-02-07 | Paper |
Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
Combinatorial Theory | 2022-11-23 | Paper |
Scaling limit of graph classes through split decomposition
| 2022-07-25 | Paper |
Scaling limits of permutation classes with a finite specification: a dichotomy
Advances in Mathematics | 2022-07-15 | Paper |
Statistics of subgroups of the modular group
International Journal of Algebra and Computation | 2022-01-13 | Paper |
Universal limits of substitution-closed permutation classes
Journal of the European Mathematical Society (JEMS) | 2020-12-17 | Paper |
Silhouettes and generic properties of subgroups of the modular group
| 2020-11-18 | Paper |
The complexity of the multiple pattern matching problem for random strings
2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-18 | Paper |
Linear-time generation of inhomogeneous random directed walks
2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
On two distributions of subgroups of free groups
2010 Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Combinatorial specification of permutation classes
| 2019-05-24 | Paper |
Scaling limits of permutation classes with a finite specification: a dichotomy
| 2019-03-18 | Paper |
The Brownian limit of separable permutations
The Annals of Probability | 2018-08-16 | Paper |
Enumerative sequences of leaves in rational trees
Automata, Languages and Programming | 2018-07-04 | Paper |
Star-height of an \(\mathbb N\)-rational series
STACS 96 | 2017-11-16 | Paper |
Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
An algorithm computing combinatorial specifications of permutation classes
Discrete Applied Mathematics | 2017-05-15 | Paper |
Generic properties of subgroups of free groups and finite presentations
Algebra and Computer Science | 2017-04-11 | Paper |
Random presentations and random subgroups: a survey
| 2017-02-07 | Paper |
On the genericity of Whitehead minimality
Journal of Group Theory | 2016-01-19 | Paper |
scientific article; zbMATH DE number 6469204 (Why is no real title available?)
| 2015-08-03 | Paper |
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
Advances in Applied Mathematics | 2015-02-06 | Paper |
Generic properties of random subgroups of a free group for general distributions.
| 2014-09-29 | Paper |
Counting occurrences for a finite set of words
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Statistical properties of subgroups of free groups.
Random Structures \& Algorithms | 2013-05-28 | Paper |
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
PU.M.A. Pure Mathematics and Applications | 2012-09-18 | Paper |
Asymptotic enumeration of minimal automata
| 2012-08-23 | Paper |
An efficient linear pseudo-minimization algorithm for Aho-Corasick automata
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Average case analysis of Moore's state minimization algorithm
Algorithmica | 2012-04-26 | Paper |
On the average complexity of Moore's state minimization algorithm
| 2012-04-24 | Paper |
Enumeration of pin-permutations
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Enumeration and random generation of possibly incomplete deterministic automata
| 2011-02-22 | Paper |
The average state complexity of rational operations on finite languages
International Journal of Foundations of Computer Science | 2010-09-06 | Paper |
Building the minimal automaton of \(A ^{*} X\) in linear time, when \(X\) is of bounded cardinality
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Accessible and deterministic automata: enumeration and Boltzmann samplers
| 2010-07-05 | Paper |
Complexity of Operations on Cofinite Languages
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
The Average State Complexity of the Star of a Finite Set of Words Is Linear
Developments in Language Theory | 2008-10-30 | Paper |
RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP
International Journal of Algebra and Computation | 2008-08-26 | Paper |
REGAL: A Library to Randomly and Exhaustively Generate Automata
Implementation and Application of Automata | 2008-06-10 | Paper |
Enumeration and random generation of accessible automata
Theoretical Computer Science | 2007-09-03 | Paper |
Arithmetic Meyer sets and finite automata
Information and Computation | 2005-10-10 | Paper |
The standard factorization of Lyndon words: an average point of view
Discrete Mathematics | 2005-02-22 | Paper |
\((q,\delta)\)-numeration systems with missing digits
Monatshefte für Mathematik | 2004-09-22 | Paper |
scientific article; zbMATH DE number 2086225 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 1948508 (Why is no real title available?)
| 2003-07-13 | Paper |
scientific article; zbMATH DE number 1714668 (Why is no real title available?)
| 2002-09-11 | Paper |
A Finite State Version of the Kraft--McMillan Theorem
SIAM Journal on Computing | 2000-10-18 | Paper |
Enumerative sequences of leaves and nodes in rational trees
Theoretical Computer Science | 2000-01-12 | Paper |
Generating functions of circular codes
Advances in Applied Mathematics | 1999-04-11 | Paper |
scientific article; zbMATH DE number 1189232 (Why is no real title available?)
| 1998-10-08 | Paper |
Nonnegative companion matrices and star-height of \(\mathbb{N}\)-rational series
Theoretical Computer Science | 1998-07-22 | Paper |
Dense and nondense limits for uniform random intersection graphs
| N/A | Paper |
