Pages that link to "Item:Q2392931"
From MaRDI portal
The following pages link to Sublinear algorithms for approximating string compressibility (Q2392931):
Displaying 7 items.
- On stricter reachable repetitiveness measures (Q2146140) (← links)
- Internal shortest absent word queries in constant time and linear space (Q2672592) (← 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)
