| Optimizing Nozzle Travel Time in Proton Therapy | 0 | 0.34 | 2022 |
| On optimal parsing for LZ78-like compressors. | 0 | 0.34 | 2018 |
| The longest common substring problem. | 0 | 0.34 | 2017 |
| Abelian-square-rich words. | 0 | 0.34 | 2017 |
| Linear-size suffix tries. | 3 | 0.41 | 2016 |
| Compressing Big Data: When the Rate of Convergence to the Entropy Matters. | 1 | 0.35 | 2015 |
| Abelian Powers and Repetitions in Sturmian Words | 4 | 0.48 | 2015 |
| Words With The Maximum Number Of Abelian Squares | 1 | 0.35 | 2015 |
| Compressing Big Data: when the rate of convergence to the entropy matters. | 0 | 0.34 | 2014 |
| Simple real-time constant-space string matching. | 0 | 0.34 | 2013 |
| The Rightmost Equal-Cost Position Problem | 5 | 0.47 | 2013 |
| A New Complexity Function For Words Based On Periodicity | 3 | 0.47 | 2013 |
| Dictionary-symbolwise flexible parsing | 3 | 0.40 | 2012 |
| Characteristic Sturmian words are extremal for the Critical Factorization Theorem | 6 | 0.64 | 2012 |
| Note on the greedy parsing optimality for dictionary-based text compression | 6 | 0.51 | 2012 |
| Simple real-time constant-space string matching | 16 | 0.75 | 2011 |
| Abelian Repetitions in Sturmian Words | 4 | 0.45 | 2011 |
| On lazy representations and sturmian graphs | 0 | 0.34 | 2010 |
| On the Longest Common Factor Problem | 1 | 0.36 | 2008 |
| On Sturmian graphs | 5 | 0.54 | 2007 |
| On the suffix automaton with mismatches | 2 | 0.38 | 2007 |
| Word assembly through minimal forbidden words | 9 | 0.66 | 2006 |
| Minimal Forbidden Patterns Of Multi-Dimensional Shifts | 3 | 0.56 | 2005 |
| A multidimensional critical factorization theorem | 1 | 0.37 | 2005 |
| Languages with mismatches and an application to approximate indexing | 4 | 0.42 | 2005 |
| Sturmian graphs and a conjecture of moser | 2 | 0.48 | 2004 |
| Indexing structures for approximate string matching | 10 | 0.66 | 2003 |
| Periodicity, morphisms, and matrices | 7 | 1.41 | 2003 |
| Computing forbidden words of regular languages | 17 | 1.28 | 2003 |
| On Fine and Wilf's theorem for bidimensional words | 13 | 1.16 | 2003 |
| On a conjecture on bidimensional words | 19 | 1.38 | 2003 |
| A Note on a Conjecture of Duval and Sturmian Words | 13 | 1.15 | 2002 |
| Variations on a Theorem of Fine & Wilf | 5 | 0.67 | 2001 |
| Forbidden Factors in Finite and Infinite Words | 3 | 0.59 | 1999 |
| Text Compression Using Antidictionaries | 18 | 2.10 | 1999 |
| Fine and Wilf's theorem for three periods and a generalization of Sturmian words | 32 | 4.20 | 1999 |
| Periodicity and the golden ratio | 16 | 1.58 | 1998 |
| Periodicities on trees | 6 | 1.30 | 1998 |
| Minimal Forbidden Words and Factor Automata | 6 | 1.16 | 1998 |
| The expressibility of languages and relations by word equations | 11 | 0.86 | 1997 |
| Minimal Forbidden Words and Symbolic Dynamics | 26 | 3.53 | 1996 |
| Some combinatorial properties of Sturmian words | 92 | 17.46 | 1994 |
| Generalizations of the Periodicity Theorem of Fine and Wilf | 10 | 0.80 | 1994 |
| If a D0L Language is k-Power Free then it is Circular | 22 | 2.24 | 1993 |
| Garden of Eden configurations for cellular automata on Cayley graphs of groups | 13 | 1.83 | 1993 |
| Repetitions in the Fibonacci infinite word | 59 | 8.78 | 1992 |
| On the number of factors of Sturmian words | 56 | 13.09 | 1991 |
| Sturmian Words and Ambigous Context-Free Languages | 2 | 0.47 | 1990 |
| Infinite words with linear subword complexity | 34 | 20.57 | 1989 |
