Optimal Parallel Searching an Array for Certain Repetitions
From MaRDI portal
Recommendations
Cites work
- 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 algorithm for computing the repetitions in a word
- Fibonacci arrays and their two-dimensional repetitions
- scientific article; zbMATH DE number 1256660 (Why is no real title available?)
- scientific article; zbMATH DE number 742992 (Why is no real title available?)
- Optimal off-line detection of repetitions in a string
- Optimal parallel pattern matching in strings
- Relations between Concurrent-Write Models of Parallel Computation
- Structural properties of the string statistics problem
- The Parallel Evaluation of General Arithmetic Expressions
Cited in
(7)- Parallel searching in generalized Monge arrays
- Optimal discovery of repetitions in 2D
- scientific article; zbMATH DE number 512895 (Why is no real title available?)
- scientific article; zbMATH DE number 1151817 (Why is no real title available?)
- scientific article; zbMATH DE number 7120968 (Why is no real title available?)
- Space efficient search for maximal repetitions
- A coarse-grained multicomputer algorithm for the detection of repetitions
This page was built for publication: Optimal Parallel Searching an Array for Certain Repetitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3438903)
