Efficient string matching on packed texts
From MaRDI portal
Recommendations
Cites work
- A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
- A Lower Bound for Parallel String Matching
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- An O(n log n) algorithm for finding all repetitions in a string
- An Optimal O(\log \log N)-Time Parallel Algorithm for Detecting all Squares in a String
- An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
- An optimal algorithm for computing the repetitions in a word
- Constant-Time Randomized Parallel String Matching
- Deterministic Sampling–A New Technique for Fast Pattern Matching
- Efficient parallel algorithms to test square-freeness and factorize strings
- Fast Pattern Matching in Strings
- Faster Parallel String Matching via Larger Deterministic Samples
- Finding all periods and initial palindromes of a string in parallel
- scientific article; zbMATH DE number 3864532 (Why is no real title available?)
- scientific article; zbMATH DE number 3913712 (Why is no real title available?)
- scientific article; zbMATH DE number 3976360 (Why is no real title available?)
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- scientific article; zbMATH DE number 1256660 (Why is no real title available?)
- scientific article; zbMATH DE number 3340123 (Why is no real title available?)
- Optimal off-line detection of repetitions in a string
- Optimal parallel algorithms for string matching
- Optimal parallel detection of squares in strings
- Optimal parallel pattern matching in strings
- Palindrome recognition in real time by a multitape Turing machine
- Parallel detection of all palindromes in a string
- Parallel Prefix Computation
- Recognizing a symmetry predicate by multihead Turing machines with input
- Relations between Concurrent-Write Models of Parallel Computation
- The equation \(a_ M=b^ Nc^ P\) in a free group
- The Parallel Evaluation of General Arithmetic Expressions
- Transducers and repetitions
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
Cited in
(7)- Efficient CRCW-PRAM algorithms for universal substring searching
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
- Fast and flexible packed string matching
- Fast Packed String Matching for Short Patterns
- A Memory-Efficient and Modular Approach for Large-Scale String Pattern Matching
- scientific article; zbMATH DE number 5684815 (Why is no real title available?)
- Fast parallel string prefix-matching
This page was built for publication: Efficient string matching on packed texts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4341037)
