Fast parallel string prefix-matching
From MaRDI portal
Publication:674342
DOI10.1016/0304-3975(94)00177-KzbMATH Open0873.68072MaRDI QIDQ674342FDOQ674342
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- Fast parallel and serial approximate string matching
- Parallel String Matching Algorithms
- scientific article; zbMATH DE number 826050
- scientific article; zbMATH DE number 2087055
- Fast prefix matching of bounded strings
- Optimal parallel algorithms for Prefix Matching
- Optimal parallel algorithms for string matching
- scientific article; zbMATH DE number 3911754
- Optimal parallel pattern matching in strings
- Parallel Suffix–Prefix-Matching Algorithm and Applications
Cites Work
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Finding all periods and initial palindromes of a string in parallel
- 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
- An O(n log n) algorithm for finding all repetitions in a string
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
- The Parallel Evaluation of General Arithmetic Expressions
- Efficient string matching on packed texts
- Testing string superprimitivity in parallel
- Optimal parallel algorithms for periods, palindromes and squares
- An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
- Optimal parallel algorithms for string matching
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Testing string superprimitivity in parallel
- Finding all periods and initial palindromes of a string in parallel
- Optimal parallel algorithms for Prefix Matching
- Efficient CRCW-PRAM algorithms for universal substring searching
- Fast prefix matching of bounded strings
- Linear-time computation of prefix table for weighted strings {\&} applications
This page was built for publication: Fast parallel string prefix-matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674342)
