A work-time optimal algorithm for computing all string covers
From MaRDI portal
Recommendations
Cites work
- A Lower Bound for Parallel String Matching
- An on-line string superprimitivity test
- COVERING A CIRCULAR STRING WITH SUBSTRINGS OF FIXED LENGTH
- Covering a string
- Efficient detection of quasiperiodicities in strings
- scientific article; zbMATH DE number 1003282 (Why is no real title available?)
- scientific article; zbMATH DE number 1003283 (Why is no real title available?)
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
- Optimal parallel algorithms for periods, palindromes and squares (extended abstract)
- Optimal superprimitivity testing for strings
- Recursive Star-Tree Parallel Data Structure
- Testing string superprimitivity in parallel
- The Parallel Evaluation of General Arithmetic Expressions
- The Parallel Simplicity of Compaction and Chaining
Cited in
(16)- Quasiperiodicity and string covering
- An optimal algorithm to compute all the covers of a string
- String covering with optimal covers
- An output-sensitive algorithm for the minimization of 2-dimensional string covers
- On left and right seeds of a string
- Computing the \(\lambda \)-covers of a string
- The subtree max gap problem with application to parallel string covering
- scientific article; zbMATH DE number 1003283 (Why is no real title available?)
- Enhanced string covering
- Fast Algorithm for Partial Covers in Words
- Fast algorithm for partial covers in words
- Generalized approximate regularities in strings
- Shortest covers of all cyclic shifts of a string
- Approximate periods of strings
- String Covering: A Survey
- Optimal superprimitivity testing for strings
This page was built for publication: A work-time optimal algorithm for computing all string covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671438)
