Searching for "Constant-Space String-Matching." – sorted by Relevance.
-
Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling
- Constant-space string matching with smaller number of comparisons: sequential sampling. Leszek
- Cited by 5 (3 self) – Add To MetaCart
-
Constant-Space String-Matching in Sublinear Average Time (Extended Abstract)
- Constant-Space String-Matching in Sublinear Average Time (Extended Abstract) Maxime Crochemore
- Cited by 1 (0 self) – Add To MetaCart
-
Saving Comparisons in the Crochemore-Perrin String Matching Algorithm
- , 1995 Abstract Crochemore and Perrin discovered an elegant linear-time constant-space string matching
- Cited by 7 (1 self) – Add To MetaCart
-
Saving Comparisons in the Crochemore-Perrin String Matching Algorithm
- [11] discovered a simple linear-time constant-space string matching algorithm that makes at most 2n
- Add To MetaCart
-
Time/Space Efficient Compressed Pattern Matching
- an exact complexity of constant space string matching. The running time of a constant space string matching
- Cited by 2 (1 self) – Add To MetaCart
-
On the Complexity of Determining the Period of a String
- . The periodicity played also a key role in later developments in string matching including: constant-space linear
- Add To MetaCart
-
Plan
- . Plandowski, and W. Rytter. Constant-space string matching with smaller number of comparisons: sequential
- Add To MetaCart

