Pages that link to "Item:Q4928577"
From MaRDI portal
The following pages link to Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings (Q4928577):
Displayed 14 items.
- Block trees (Q2221797) (← links)
- Finger search in grammar-compressed strings (Q2322694) (← links)
- Approximate pattern matching in LZ77-compressed texts (Q2343301) (← links)
- Block graphs in practice (Q2363994) (← links)
- Grammar compressed sequences with rank/select support (Q2397151) (← links)
- Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
- Random Access to High-Order Entropy Compressed Text (Q2848976) (← links)
- Access, Rank, and Select in Grammar-compressed Strings (Q3452777) (← links)
- Optimal rank and select queries on dictionary-compressed text (Q5088891) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
- (Q6065455) (← links)
- Balancing run-length straight-line programs (Q6111582) (← links)
- Random access in persistent strings and segment selection (Q6174650) (← links)