The following pages link to (Q4607988):
Displaying 20 items.
- Dynamic layers of maxima with applications to dominating queries (Q827327) (← links)
- Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
- Shortest unique palindromic substring queries in semi-dynamic settings (Q2169977) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Dynamic index and LZ factorization in compressed space (Q2295634) (← links)
- Sensitivity of string compressors and repetitiveness measures (Q2687989) (← links)
- Upper and Lower Bounds for Dynamic Data Structures on Strings (Q3304117) (← links)
- (Q3694726) (← links)
- (Q5009593) (← links)
- Repetition Detection in a Dynamic String (Q5075738) (← links)
- Longest common substring made fully dynamic (Q5075739) (← links)
- Online algorithms for constructing linear-size suffix trie (Q5088922) (← links)
- Automata, Languages and Programming (Q5466498) (← links)
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
- (Q6065473) (← links)
- Data structures for computing unique palindromes in static and non-static strings (Q6119834) (← links)
- Online algorithms on antipowers and antiperiods (Q6536254) (← links)
- Space-efficient conversions from SLPs (Q6547925) (← links)
- Linear time online algorithms for constructing linear-size suffix trie (Q6614010) (← links)
- Internal pattern matching queries in a text and applications (Q6621750) (← links)