The Boyer Moore Galil string searching strategies revisited
SIAM Journal on Computing
Theoretical Computer Science
Complete inverted files for efficient text retrieval and analysis
Journal of the ACM (JACM)
Computer algorithms: introduction to design and analysis (2nd ed.)
Computer algorithms: introduction to design and analysis (2nd ed.)
Introduction to algorithms
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
Information retrieval: data structures and algorithms
Information retrieval: data structures and algorithms
On the exact complexity of string matching: upper bounds
SIAM Journal on Computing
A new approach to text searching
Communications of the ACM
Fast text searching: allowing errors
Communications of the ACM
Software—Practice & Experience
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
On Simon's string searching algorithm
Information Processing Letters
Fastest pattern matching in strings
Journal of Algorithms
String searching algorithms
Tight Bounds on the Complexity of the Boyer--Moore String Matching Algorithm
SIAM Journal on Computing
Text algorithms
Tighter Lower Bounds on the Exact Complexity of String Matching
SIAM Journal on Computing
Experimental results on string matching algorithms
Software—Practice & Experience
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
A String Matching Algorithm Fast on the Average
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Optimal suffix tree construction with large alphabets
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Algorithms on Strings
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Linear-time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Space efficient linear time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
| Hi-index | 0.00 |