Optimal parallel pattern matching in strings
From MaRDI portal
Recommendations
Cited in
(56)- Derivation of a parallel string matching algorithm
- Fast string matching with k differences
- Matching patterns in strings subject to multi-linear transformations
- String search in coarse-grained parallel computers
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- Optimal parallel detection of squares in strings
- Optimal parallel two dimensional text searching on a CREW PRAM
- Alphabet-independent optimal parallel search for three-dimensional patterns
- An efficient parallel algorithm for the single function coarsest partition problem
- On two-dimensional pattern matching by optimal parallel algorithms
- Sorting strings and constructing digital search trees in parallel
- Inplace run-length 2d compressed search.
- Parallel two dimensional witness computation
- Squares, cubes, and time-space efficient string searching
- Finding all periods and initial palindromes of a string in parallel
- Fast parallel and serial multidimensional approximate array matching
- Towards optimal packed string matching
- Generalized function matching
- On minimizing pattern splitting in multi-track string matching
- Optimal discovery of repetitions in 2D
- scientific article; zbMATH DE number 3870652 (Why is no real title available?)
- scientific article; zbMATH DE number 4205980 (Why is no real title available?)
- Optimal Parallel Searching an Array for Certain Repetitions
- Significant Subpatterns Matching
- On Minimizing Pattern Splitting in Multi-track String Matching
- scientific article; zbMATH DE number 3911754 (Why is no real title available?)
- Optimal parallel algorithms for string matching
- scientific article; zbMATH DE number 4041265 (Why is no real title available?)
- Parallel String Matching Algorithms
- A Lower Bound for Parallel String Matching
- scientific article; zbMATH DE number 176779 (Why is no real title available?)
- Faster Parallel String Matching via Larger Deterministic Samples
- On the lower bound for parallel string matching
- Efficient string matching on packed texts
- A constant-time optimal parallel string-matching algorithm
- Constant-Time Randomized Parallel String Matching
- Optimal parallel algorithms for Prefix Matching
- Optimal two-dimensional compressed matching
- Parallel Suffix–Prefix-Matching Algorithm and Applications
- scientific article; zbMATH DE number 826050 (Why is no real title available?)
- scientific article; zbMATH DE number 826061 (Why is no real title available?)
- Simple Optimal Parallel Multiple Pattern Matching
- On linear-time alphabet-independent 2-dimensional pattern matching
- Optimal parallel algorithms for periods, palindromes and squares (extended abstract)
- Parallel algorithms for combinatorial pattern matching
- Heterogeneous parallel string matching algorithm based on mobile platform
- On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
- Optimal parallel string matching algorithm on body centered hypercube
- Parallel String Matching
- A seven-head dragon for optimal pattern searching
- N-cube string matching algorithm with long texts
- Fast parallel string prefix-matching
- Two-dimensional pattern matching by sampling
- A string-matching algorithm for the CREW PRAM
- String problems in the congested clique model
- Parallel tree pattern matching
This page was built for publication: Optimal parallel pattern matching in strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3716299)
