Pages that link to "Item:Q3189037"
From MaRDI portal
The following pages link to Succinct indexes for strings, binary relations and multilabeled trees (Q3189037):
Displayed 20 items.
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- Succinct posets (Q329288) (← links)
- Compact binary relation representations with rich functionality (Q386006) (← links)
- Space efficient data structures for dynamic orthogonal range counting (Q390134) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Optimal indexes for sparse bit vectors (Q472491) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- Block trees (Q2221797) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- Grammar compressed sequences with rank/select support (Q2397151) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- General Document Retrieval in Compact Space (Q2828189) (← links)
- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures (Q2848970) (← links)
- Random Access to High-Order Entropy Compressed Text (Q2848976) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Succinct Representations of Ordinal Trees (Q2848982) (← links)
- Compressed Data Structures for Dynamic Sequences (Q3452849) (← links)
- (Q6065424) (← links)