Simple and flexible detection of contiguous repeats using a suffix tree
Theoretical Computer Science
Solving the String Statistics Problem in Time O(n log n)
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Multiple Pattern Matching Algorithms on Collage System
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
On Maximal Repetitions in Words
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Finding Maximal Repetitions in a Word in Linear Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Linear-time computation of local periods
Theoretical Computer Science
Linear time algorithms for finding and representing all the tandem repeats in a string
Journal of Computer and System Sciences
A simple proof that a word of length n has at most 2n distinct squares
Journal of Combinatorial Theory Series A
A note on the number of squares in a word
Theoretical Computer Science
Maximal repetitions in strings
Journal of Computer and System Sciences
Repetitions in strings: Algorithms and combinatorics
Theoretical Computer Science
Counting distinct squares in partial words
Acta Cybernetica
Optimality of some algorithms to detect quasiperiodicities
Theoretical Computer Science
Distinct squares in run-length encoded strings
Theoretical Computer Science
A minimal periods algorithm with applications
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Extracting powers and periods in a string from its runs structure
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
A d-step approach for distinct squares in strings
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Hunting redundancies in strings
DLT'11 Proceedings of the 15th international conference on Developments in language theory
The three-squares lemma for partial words with one hole
Theoretical Computer Science
Squares in binary partial words
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
The maximum number of squares in a tree
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
On the maximum number of cubic subwords in a word
European Journal of Combinatorics
Analysis of maximal repetitions in strings
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
New simple efficient algorithms computing powers and runs in strings
Discrete Applied Mathematics
A d-step approach to the maximum number of distinct squares and runs in strings
Discrete Applied Mathematics
Extracting powers and periods in a word from its runs structure
Theoretical Computer Science
| Hi-index | 0.01 |