A work-time optimal algorithm for computing all string covers

DOI10.1016/0304-3975(96)00047-3zbMath0871.68089OpenAlexW1992597116MaRDI 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

zbMATH Keywords

repetitive structures of strings

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items

On left and right seeds of a string, Computing the \(\lambda \)-covers of a string, Enhanced string covering, String Covering: A Survey, Approximate periods of strings, Generalized approximate regularities in strings, Quasiperiodicity and string covering

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