The subtree max gap problem with application to parallel string covering
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Solving the String Statistics Problem in Time O(n log n)
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Finding Maximal Quasiperiodicities in Strings
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Periods and Quasiperiods Characterization
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Approximate Periods of Strings
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
String pattern matching for a deluge survival kit
Handbook of massive data sets
String regularities with don't cares
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Collage of two-dimensional words
Theoretical Computer Science - The art of theory
A language-theoretic approach to covering problems
Journal of Automata, Languages and Combinatorics
Quasiperiodic Sturmian words and morphisms
Theoretical Computer Science
Discovering regularities in biosequences: Challenges and applications
Journal of Computational Methods in Sciences and Engineering
Quasiperiodic and Lyndon episturmian words
Theoretical Computer Science
The subsequence composition of a string
Theoretical Computer Science
Covering problems from a formal language point of view
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Optimality of some algorithms to detect quasiperiodicities
Theoretical Computer Science
Cover array string reconstruction
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Efficient seeds computation revisited
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
On the right-seed array of a string
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A linear time algorithm for seeds computation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The set of parameterized k-covers problem
Theoretical Computer Science
Linear time inference of strings from cover arrays using a binary alphabet
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Computing regularities in strings: A survey
European Journal of Combinatorics
Overlapping repetitions in weighted sequence
Proceedings of the CUBE International Information Technology Conference
Efficient seed computation revisited
Theoretical Computer Science
Theoretical Computer Science
Hi-index | 5.23 |