Pages that link to "Item:Q942991"
From MaRDI portal
The following pages link to Lempel-Ziv factorization using less time \& space (Q942991):
Displaying 15 items.
- On compressing and indexing repetitive sequences (Q390894) (← links)
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case (Q396650) (← links)
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Three overlapping squares: the general case characterized \& applications (Q2355701) (← links)
- On succinct representations of binary trees (Q2363992) (← links)
- Improved range minimum queries (Q2397152) (← links)
- Locating maximal approximate runs in a string (Q2410363) (← links)
- Note on the greedy parsing optimality for dictionary-based text compression (Q2437746) (← links)
- Speeding up the detection of tandem repeats over the edit distance (Q2437752) (← links)
- Lempel-Ziv Factorization Revisited (Q3011840) (← links)
- Phenomenology of coupled nonlinear oscillators (Q4565923) (← links)
- On the size of overlapping Lempel-Ziv and Lyndon factorizations (Q5088921) (← links)
- Lazy Lempel-Ziv Factorization Algorithms (Q5266607) (← links)
