Pages that link to "Item:Q5204325"

The following pages link to Optimal parallel algorithms for periods, palindromes and squares (Q5204325):

Displaying 10 items.

• A work-time optimal algorithm for computing all string covers (Q671438) (← links)
• Parallel detection of all palindromes in a string (Q673783) (← links)
• Fast parallel string prefix-matching (Q674342) (← links)
• Testing string superprimitivity in parallel (Q1318749) (← links)
• Finding maximal 2-dimensional palindromes (Q1740657) (← links)
• Finding approximate palindromes in strings (Q1860243) (← links)
• Parallel two dimensional witness computation (Q1887160) (← links)
• Efficient algorithms for Lempel-Ziv encoding (Q5054830) (← links)
• Approximate periods of strings (Q5958136) (← links)
• (Q6065473) (← links)