Pages that link to "Item:Q906407"
From MaRDI portal
The following pages link to A \textit{really} simple approximation of smallest grammar (Q906407):
Displayed 15 items.
- Approximation of smallest linear tree grammar (Q342719) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- Balancing straight-line programs for strings and trees (Q2106614) (← links)
- Block trees (Q2221797) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
- LZRR: LZ77 parsing with right reference (Q2672241) (← links)
- Sensitivity of string compressors and repetitiveness measures (Q2687989) (← links)
- (Q5088897) (← links)
- A Self-index on Block Trees (Q5150940) (← links)
- Near-optimal search time in \(\delta \)-optimal space, and vice versa (Q6130318) (← links)
- Near-optimal search time in \(\delta \)-optimal space (Q6163966) (← links)
