Pages that link to "Item:Q4928572"
From MaRDI portal
The following pages link to Linear Time Lempel-Ziv Factorization: Simple, Fast, Small (Q4928572):
Displaying 22 items.
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text (Q507399) (← links)
- LZ77 computation based on the run-length encoded BWT (Q724214) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- A \textit{really} simple approximation of smallest grammar (Q906407) (← links)
- Lempel-Ziv factorization using less time \& space (Q942991) (← links)
- Lempel-Ziv-like parsing in small space (Q2205632) (← links)
- Constructing LZ78 tries and position heaps in linear time for large alphabets (Q2346553) (← links)
- Generalized substring compression (Q2437745) (← links)
- A comparison of index-based Lempel-Ziv LZ77 factorization algorithms (Q2875093) (← links)
- Lempel Ziv Computation in Small Space (LZ-CISS) (Q2942255) (← links)
- Faster Compact On-Line Lempel-Ziv Factorization (Q2965527) (← links)
- Lempel-Ziv Factorization Revisited (Q3011840) (← links)
- Range Predecessor and Lempel-Ziv Parsing (Q4575728) (← links)
- Bidirectional Text Compression in External Memory (Q5075783) (← links)
- LZ-End Parsing in Linear Time (Q5111742) (← links)
- Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries (Q5150931) (← links)
- Lazy Lempel-Ziv Factorization Algorithms (Q5266607) (← links)
- LCP Array Construction in External Memory (Q5266615) (← links)
- On the computation of longest previous non-overlapping factors (Q6536266) (← links)
- Sublinear time Lempel-Ziv (LZ77) factorization (Q6545423) (← links)
- New advances in rightmost Lempel-Ziv (Q6545424) (← links)
- On the number of factors in the LZ-End factorization (Q6545432) (← links)
