The following pages link to (Q4952706):
Displaying 16 items.
- Text sparsification via local maxima. (Q1401406) (← links)
- Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
- Improved dynamic dictionary matching (Q1893741) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- Dynamic index and LZ factorization in compressed space (Q2295634) (← links)
- (Q2766979) (← links)
- Dynamic string searching (Q2768310) (← links)
- Upper and Lower Bounds for Dynamic Data Structures on Strings (Q3304117) (← links)
- Equality Testing of Compressed Strings (Q3449353) (← links)
- (Q5009593) (← links)
- Longest common substring made fully dynamic (Q5075739) (← links)
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
- Algorithms and Data Structures (Q5900766) (← links)
- (Q6065473) (← links)
- Space-efficient conversions from SLPs (Q6547925) (← links)