| Publication | Date of Publication | Type |
|---|
| Branch prediction analysis of Morris-Pratt and Knuth-Morris-Pratt algorithms | 2026-07-17 | Paper |
| Weakly-unambiguous Parikh automata and their link to holonomic series | 2026-03-18 | Paper |
Mathematical models to analyze Lua hybrid tables
Theoretical Computer Science | 2025-05-12 | Paper |
Random deterministic automata with one added transition
Logical Methods in Computer Science | 2025-03-06 | Paper |
Random generation of subgroups of the modular group with a fixed isomorphism type
The Electronic Journal of Combinatorics | 2024-11-09 | Paper |
| One drop of non-determinism in a random deterministic automaton | 2024-10-08 | Paper |
| Back-to-front online Lyndon forest construction | 2024-05-06 | 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 Regular Expression Over Huge Alphabets
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Simplifications of Uniform Expressions Specified by Systems
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
A probabilistic model revealing shortcomings in Lua's hybrid tables
Lecture Notes in Computer Science | 2023-08-10 | Paper |
On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
Developments in Language Theory | 2022-10-13 | Paper |
| Uniform random expressions lack expressivity | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7559240 (Why is no real title available?) | 2022-07-18 | Paper |
Statistics of subgroups of the modular group
International Journal of Algebra and Computation | 2022-01-13 | Paper |
On the worst-case complexity of TimSort
(available as arXiv preprint) | 2021-08-04 | Paper |
Synchronizing almost-group automata
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
scientific article; zbMATH DE number 7324093 (Why is no real title available?)
(available as arXiv preprint) | 2021-03-17 | Paper |
| Silhouettes and generic properties of subgroups of the modular group | 2020-11-18 | Paper |
Some families of trees arising in permutation analysis
The Electronic Journal of Combinatorics | 2020-06-04 | Paper |
| Gapped pattern statistics | 2020-05-25 | Paper |
| On the biased partial word collector problem | 2020-02-12 | Paper |
| The Cerny Conjecture Holds with High Probability | 2020-01-15 | 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 |
| Analysis of algorithms for permutations biased by their number of records | 2019-04-29 | Paper |
Synchronizing random almost-group automata
(available as arXiv preprint) | 2018-11-07 | Paper |
| On the expected number of distinct gapped palindromic factors | 2018-09-06 | Paper |
scientific article; zbMATH DE number 6861928 (Why is no real title available?)
(available as arXiv preprint) | 2018-04-19 | Paper |
| Good predictions are worth a few comparisons | 2018-01-24 | Paper |
| Estimating statistics on words using ambiguous descriptions | 2017-10-17 | Paper |
Generic properties of subgroups of free groups and finite presentations
Algebra and Computer Science | 2017-04-11 | Paper |
| Random generation using binomial approximations | 2017-02-10 | Paper |
Random presentations and random subgroups: a survey
(available as arXiv preprint) | 2017-02-07 | Paper |
Average case analysis of Brzozowski's algorithm
International Journal of Foundations of Computer Science | 2016-06-23 | Paper |
On the genericity of Whitehead minimality
Journal of Group Theory | 2016-01-19 | Paper |
A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm
Combinatorial Pattern Matching | 2015-08-20 | Paper |
| scientific article; zbMATH DE number 6469204 (Why is no real title available?) | 2015-08-03 | Paper |
On the average complexity of Brzozowski's algorithm for deterministic automata with a small number of final states
Developments in Language Theory | 2014-10-14 | Paper |
Random deterministic automata
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
| Generic properties of random subgroups of a free group for general distributions. | 2014-09-29 | Paper |
| Some simple varieties of trees arising in permutation analysis | 2014-02-18 | Paper |
Brzozowski algorithm is generically super-polynomial for deterministic automata
Developments in Language Theory | 2013-06-28 | Paper |
Random generation of deterministic acyclic automata using the recursive method
Computer Science – Theory and Applications | 2013-06-14 | Paper |
Statistical properties of subgroups of free groups.
Random Structures & Algorithms | 2013-05-28 | Paper |
Set systems and families of permutations with small traces
European Journal of Combinatorics | 2012-12-03 | Paper |
| Average analysis of Glushkov automata under a BST-like model | 2012-08-29 | Paper |
| Distribution of the number of accessible states in a random deterministic automaton | 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 and random generation of possibly incomplete deterministic automata | 2011-02-22 | Paper |
A challenging family of automata for classical minimization algorithms
Implementation and Application of Automata | 2011-02-11 | Paper |
Parametric random generation of deterministic tree automata
Theoretical Computer Science | 2010-10-07 | 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 |
Random Generation of Deterministic Tree (Walking) Automata
Implementation and Application of Automata | 2009-07-09 | Paper |
On the Average Size of Glushkov’s Automata
Language and Automata Theory and Applications | 2009-04-02 | 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 |
The standard factorization of Lyndon words: an average point of view
Discrete Mathematics | 2005-02-22 | Paper |
| scientific article; zbMATH DE number 1948508 (Why is no real title available?) | 2003-07-13 | Paper |
| scientific article; zbMATH DE number 1418342 (Why is no real title available?) | 2000-03-19 | Paper |
