Optimal parallel algorithms for periods, palindromes and squares (extended abstract)
From MaRDI portal
Recommendations
- Finding all periods and initial palindromes of a string in parallel
- An Optimal O(\log \log N)-Time Parallel Algorithm for Detecting all Squares in a String
- Optimal parallel detection of squares in strings
- Squares, cubes, and time-space efficient string searching
- Efficient parallel algorithms to test square-freeness and factorize strings
Cites work
- A Lower Bound for Parallel String 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
- Efficient parallel algorithms to test square-freeness and factorize strings
- Fast Pattern Matching in Strings
- Finding all periods and initial palindromes of a string in parallel
- scientific article; zbMATH DE number 3913712 (Why is no real title available?)
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- Optimal bounds for decision problems on the CRCW PRAM
- Optimal off-line detection of repetitions in a string
- Optimal parallel detection of squares in strings
- Optimal parallel pattern matching in strings
- 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
(16)- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- Efficient parallel algorithms to test square-freeness and factorize strings
- Optimal parallel detection of squares in strings
- Parallel finding all initial palindromes and periods of a string on reconfigurable meshes
- Testing string superprimitivity in parallel
- Finding maximal 2-dimensional palindromes
- Finding approximate palindromes in strings
- Parallel two dimensional witness computation
- Finding all periods and initial palindromes of a string in parallel
- Efficient algorithms for Lempel-Ziv encoding
- An Optimal O(\log \log N)-Time Parallel Algorithm for Detecting all Squares in a String
- Approximate periods of strings
- scientific article; zbMATH DE number 7765421 (Why is no real title available?)
- A work-time optimal algorithm for computing all string covers
- Parallel detection of all palindromes in a string
- Fast parallel string prefix-matching
This page was built for publication: Optimal parallel algorithms for periods, palindromes and squares (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204325)
