Pages that link to "Item:Q5075738"

The following pages link to Repetition Detection in a Dynamic String (Q5075738):

Displaying 12 items.

• Multidimensional period recovery (Q2144266) (← links)
• Minimal unique palindromic substrings after single-character substitution (Q2146122) (← links)
• The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
• Shortest unique palindromic substring queries in semi-dynamic settings (Q2169977) (← links)
• Dynamic and internal longest common substring (Q2211363) (← links)
• Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
• Longest common substring made fully dynamic (Q5075739) (← links)
• (Q5874500) (← links)
• Finding top-\(k\) longest palindromes in substrings (Q6057835) (← links)
• (Q6065473) (← links)
• Data structures for computing unique palindromes in static and non-static strings (Q6119834) (← links)
• Near-optimal quantum algorithms for string problems (Q6174814) (← links)