On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On the Complexity of Determining the Period of a String
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
On maximal suffixes and constant-space linear-time versions of KMP algorithm
Theoretical Computer Science
String matching with simple devices
Information Processing Letters
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Succinct backward-DAWG-matching
Journal of Experimental Algorithmics (JEA)
CPM's 20th Anniversary: A Statistical Retrospective
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Simple real-time constant-space string matching
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Periodicity algorithms for partial words
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Simple real-time constant-space string matching
Theoretical Computer Science
A note on a simple computation of the maximal suffix of a string
Journal of Discrete Algorithms
| Hi-index | 0.00 |