Optimal parallel pattern matching in strings
Information and Control
Optimal parallel algorithms for string matching
Information and Control
The Boyer Moore Galil string searching strategies revisited
SIAM Journal on Computing
An optimal O(log n)time parallel string matching algorithm
SIAM Journal on Computing
Deterministic sampling: a new technique for fast pattern matching
SIAM Journal on Computing
A lower bound for parallel string matching
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
Journal of the ACM (JACM)
On the exact complexity of string matching: lower bounds
SIAM Journal on Computing
Optimal canonization of all substrings of a string
Information and Computation
Correctness and efficiency of pattern matching algorithms
Information and Computation
Alphabet independent two dimensional matching
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
String-matching on ordered alphabets
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Tight comparison bounds for the string prefix-matching problem
Information Processing Letters
An Alphabet Independent Approach to Two-Dimensional Pattern Matching
SIAM Journal on Computing
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
The zooming method: a recursive approach to time-space efficient string-matching
Theoretical Computer Science
Work-time-optimal parallel algorithms for string problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Alphabet-Independent Two-Dimensional Witness Computation
SIAM Journal on Computing
Tighter Upper Bounds on the Exact Complexity of String Matching
SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Constant-Time Randomized Parallel String Matching
SIAM Journal on Computing
Pattern matching algorithms
Off-line serial exact string searching
Pattern matching algorithms
Two-Dimensional Periodicity in Rectangular Arrays
SIAM Journal on Computing
On the comparison complexity of the string prefix-matching problem
Journal of Algorithms
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
Real-time algorithms for string-matching and palindrome recognition
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
On the exact complexity of string matching
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Periodicity and cyclic shifts via linear sketches
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
| Hi-index | 0.00 |
We study the complexity of a classical combinatorial problem of computing the period of a string. We investigate both the average- and the worst-case complexity of the problem. We deliver almost tight bounds for the average-case. We show that every algorithm computing the period must examine Ω(√m) symbols of an input string of length m. On the other hand we present an algorithm that computes the period by examining on average O (√m ċ log|Σ|m) symbols, where Σ ≥ 2 stands for the input alphabet. We also present a deterministic algorithm that computes the period of a string using m+O(m3/4) comparisons. This is the first algorithm that have the worstcase complexity m + o(m).