A work-time optimal algorithm for computing all string covers
From MaRDI portal
Publication:671438
DOI10.1016/0304-3975(96)00047-3zbMath0871.68089MaRDI QIDQ671438
Costas S. Iliopoulos, Kun Soo Park
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(96)00047-3
68W10: Parallel algorithms in computer science
Related Items
Generalized approximate regularities in strings, Approximate periods of strings, Enhanced string covering, Quasiperiodicity and string covering, On left and right seeds of a string, Computing the \(\lambda \)-covers of a string
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient detection of quasiperiodicities in strings
- Optimal superprimitivity testing for strings
- An on-line string superprimitivity test
- Testing string superprimitivity in parallel
- Covering a string
- A Lower Bound for Parallel String Matching
- Recursive Star-Tree Parallel Data Structure
- The Parallel Evaluation of General Arithmetic Expressions
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
- The Parallel Simplicity of Compaction and Chaining
- Optimal parallel algorithms for periods, palindromes and squares
- COVERING A CIRCULAR STRING WITH SUBSTRINGS OF FIXED LENGTH