The following pages link to LPF Computation Revisited (Q3651543):
Displaying 10 items.
- 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)
- Parameterized longest previous factor (Q441845) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Computing the longest previous factor (Q1761495) (← links)
- Computing longest previous non-overlapping factors (Q1944092) (← links)
- Note on the greedy parsing optimality for dictionary-based text compression (Q2437746) (← links)
- Lempel-Ziv Factorization Revisited (Q3011840) (← links)
- Lazy Lempel-Ziv Factorization Algorithms (Q5266607) (← links)
- On the computation of longest previous non-overlapping factors (Q6536266) (← links)
