Pages that link to "Item:Q2392931"
From MaRDI portal
The following pages link to Sublinear algorithms for approximating string compressibility (Q2392931):
Displaying 15 items.
- Upper bounds on distinct maximal (sub-)repetitions in compressed strings (Q832954) (← links)
- On stricter reachable repetitiveness measures (Q2146140) (← links)
- Adaptive learning of compressible strings (Q2664947) (← links)
- Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
- Sensitivity of string compressors and repetitiveness measures (Q2687989) (← links)
- (Q4496242) (← links)
- NC algorithms for finding a maximal set of paths with application to compressing strings (Q4645170) (← links)
- At the roots of dictionary compression: string attractors (Q5230341) (← links)
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space (Q5458854) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900557) (← links)
- Near-optimal search time in \(\delta \)-optimal space, and vice versa (Q6130318) (← links)
- Compressibility measures for two-dimensional data (Q6545417) (← links)
- Sublinear time Lempel-Ziv (LZ77) factorization (Q6545423) (← links)
- Frequency-constrained substring complexity (Q6545444) (← links)
- Iterated straight-line programs (Q6547917) (← links)