Time/Space Efficient Compressed Pattern Matching
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Time/space efficient compressed pattern matching
Fundamenta Informaticae - Special issue on computing patterns in strings
Simple real-time constant-space string matching
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
The Ehrenfeucht-Silberger problem
Journal of Combinatorial Theory Series A
Characteristic Sturmian words are extremal for the Critical Factorization Theorem
Theoretical Computer Science
Time/Space Efficient Compressed Pattern Matching
Fundamenta Informaticae - Computing Patterns in Strings
The exact online string matching problem: A review of the most recent results
ACM Computing Surveys (CSUR)
Simple real-time constant-space string matching
Theoretical Computer Science
| Hi-index | 5.23 |