The following pages link to (Q4053104):
Displayed 11 items.
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case (Q396650) (← links)
- Dictionary-symbolwise flexible parsing (Q450551) (← links)
- The greedy approach to dictionary-based static text compression on a distributed system (Q491153) (← links)
- On-line longest fragment first parsing algorithm (Q671390) (← links)
- Text compression methods (Q805263) (← links)
- Worst-case analysis of the iterated longest fragment algorithm (Q1603464) (← links)
- On optimal parsing for LZ78-like compressors (Q1698700) (← links)
- The smallest grammar problem as constituents choice and minimal grammar parsing (Q1736491) (← links)
- The fractional greedy algorithm for data compression (Q1906680) (← links)
- Dictionary-Symbolwise Flexible Parsing (Q3000525) (← links)
- Bicriteria Data Compression (Q5242925) (← links)