Optimal parallel pattern matching in strings
Information and Control
Efficient string matching with k mismatches
Theoretical Computer Science
The Boyer Moore Galil string searching strategies revisited
SIAM Journal on Computing
Theoretical Computer Science
Longest common factor of two words
The International Joint Conference on theory and practice of software development on TAPSOFT '87
Algorithms
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On improving the worst case running time of the Boyer-Moore string matching algorithm
Communications of the ACM
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Rapid identification of repeated patterns in strings, trees and arrays
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
Time/Space Efficient Compressed Pattern Matching
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Speeding Up Pattern Matching by Text Compression
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
On maximal suffixes and constant-space linear-time versions of KMP algorithm
Theoretical Computer Science
Time/space efficient compressed pattern matching
Fundamenta Informaticae - Special issue on computing patterns in strings
Linear-time computation of local periods
Theoretical Computer Science
Partial words and the critical factorization theorem
Journal of Combinatorial Theory Series A
A proof of the extended Duval's conjecture
Theoretical Computer Science - Combinatorics on words
On unique factorizations of primitive words
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
A multidimensional critical factorization theorem
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
The structure of subword graphs and suffix trees of Fibonacci words
Theoretical Computer Science - Implementation and application of automata
Periodicity and unbordered words: A proof of the extended duval conjecture
Journal of the ACM (JACM)
Partial words and the critical factorization theorem revisited
Theoretical Computer Science
String matching with simple devices
Information Processing Letters
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
On the Relation between Periodicity and Unbordered Factors of Finite Words
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Succinct backward-DAWG-matching
Journal of Experimental Algorithmics (JEA)
Discrete Applied Mathematics
The Ehrenfeucht-Silberger Problem
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Repetitions in strings: Algorithms and combinatorics
Theoretical Computer Science
Watson-Crick conjugate and commutative words
DNA13'07 Proceedings of the 13th international conference on DNA computing
Ultra-high throughput string matching for deep packet inspection
Proceedings of the Conference on Design, Automation and Test in Europe
Simple real-time constant-space string matching
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Succinct 2D dictionary matching with no slowdown
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
The Ehrenfeucht-Silberger problem
Journal of Combinatorial Theory Series A
A taxonomy of some right-to-left string-matching algorithms
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
A fast string search algorithm for deep packet classification
Computer Communications
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
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
Lyndon fountains and the Burrows-Wheeler transform
Proceedings of the CUBE International Information Technology Conference
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
Generic algorithms for factoring strings
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.01 |