Non-standard stringology: algorithms and complexity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the Complexity of Determining the Period of a String
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
On a conjecture on bidimensional words
Theoretical Computer Science
A simple fast hybrid pattern-matching algorithm
Journal of Discrete Algorithms
Natural Computing: an international journal
A simple fast hybrid pattern-matching algorithm
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |