The following pages link to (Q4449187):
Displaying 14 items.
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Succinct encoding of arbitrary graphs (Q391972) (← links)
- Succinct representations of permutations and functions (Q441860) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- A simple optimal representation for balanced parentheses (Q859854) (← links)
- Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
- Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
- Succinct representation of labeled graphs (Q2428673) (← links)
- Minimal indices for predecessor search (Q2514143) (← links)
- GLOUDS: representing tree-like graphs (Q2634715) (← links)
- Self-indexing Based on LZ77 (Q3011842) (← links)
- LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations (Q3011862) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
- Faster Compressed Suffix Trees for Repetitive Collections (Q5266617) (← links)
