Pages that link to "Item:Q3452849"
From MaRDI portal
The following pages link to Compressed Data Structures for Dynamic Sequences (Q3452849):
Displaying 17 items.
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Rank/select on dynamic compressed sequences and applications (Q732036) (← links)
- Compressed depth sequences (Q1006078) (← links)
- Finding modes with equality comparisons (Q1680532) (← links)
- A faster implementation of online RLBWT and its application to LZ77 parsing (Q1711660) (← links)
- Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
- Faster online computation of the succinct longest previous factor array (Q2106621) (← links)
- Space-efficient B trees via load-balancing (Q2169966) (← links)
- Compressed dynamic range majority and minority data structures (Q2182101) (← links)
- Compressed data structures: Dictionaries and data-aware measures (Q2465063) (← links)
- A universal algorithm for sequential data compression (Q4158937) (← links)
- (Q4279502) (← links)
- (Q5116481) (← links)
- Dynamic Compressed Strings with Random Access (Q5326587) (← links)
- Automata, Languages and Programming (Q5466498) (← links)
- (Q6065455) (← links)
- Random access in persistent strings and segment selection (Q6174650) (← links)