Pages that link to "Item:Q1796825"
From MaRDI portal
The following pages link to The smallest grammar problem revisited (Q1796825):
Displaying 7 items.
- A separation between RLSLPs and LZ77 (Q1632509) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
- Diverse Palindromic Factorization is NP-Complete (Q4640035) (← links)
- On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation (Q5150918) (← links)
- Approximation ratios of \textsf{RePair}, \textsf{LongestMatch} and \textsf{Greedy} on unary strings (Q6536243) (← links)
