The following pages link to Generalized substring compression (Q2437745):
Displaying 10 items.
- Computing minimal and maximal suffixes of a substring (Q294952) (← links)
- Generalized substring selectivity estimation (Q1394798) (← links)
- Internal dictionary matching (Q2037109) (← links)
- Sublinear algorithms for approximating string compressibility (Q2392931) (← links)
- Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
- Finding characteristic substrings from compressed texts (Q2909195) (← links)
- Bicriteria Data Compression (Q5242925) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900557) (← links)
- A linear-space data structure for range-LCP queries in poly-logarithmic time (Q5918832) (← links)
- Internal pattern matching queries in a text and applications (Q6621750) (← links)
