Fast parallel string prefix-matching
From MaRDI portal
Publication:674342
DOI10.1016/0304-3975(94)00177-KzbMath0873.68072MaRDI QIDQ674342
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (4)
Finding all periods and initial palindromes of a string in parallel ⋮ Optimal parallel algorithms for Prefix Matching ⋮ Fast prefix matching of bounded strings ⋮ Testing string superprimitivity in parallel
Cites Work
- Unnamed Item
- Unnamed Item
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Testing string superprimitivity in parallel
- Finding all periods and initial palindromes of a string in parallel
- An O(n log n) algorithm for finding all repetitions in a string
- An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
- Optimal parallel algorithms for string matching
- Finding the maximum, merging, and sorting in a parallel computation model
- A Lower Bound for Parallel String Matching
- Fast Pattern Matching in Strings
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- Efficient string matching on packed texts
- The Parallel Evaluation of General Arithmetic Expressions
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
- Optimal parallel algorithms for periods, palindromes and squares
This page was built for publication: Fast parallel string prefix-matching
