Pages that link to "Item:Q4962682"
From MaRDI portal
The following pages link to Succinct indexable dictionaries with applications to encoding <i>k</i> -ary trees, prefix sums and multisets (Q4962682):
Displaying 31 items.
- Succinct encoding of binary strings representing triangulations (Q2665909) (← links)
- Faster repetition-aware compressed suffix trees based on block trees (Q2672222) (← links)
- Compact representation of graphs with bounded bandwidth or treedepth (Q2672250) (← links)
- Succinct permutation graphs (Q2684486) (← links)
- Locally Compressed Suffix Arrays (Q2828176) (← 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)
- Space Efficient Data Structures for Nearest Larger Neighbor (Q2946053) (← links)
- Encoding range minima and range top-2 queries (Q2955625) (← links)
- Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet (Q3010401) (← links)
- Compact Navigation and Distance Oracles for Graphs with Small Treewidth (Q3012812) (← links)
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing (Q3183444) (← links)
- Nearly Optimal Static Las Vegas Succinct Dictionary (Q5080480) (← links)
- Compressed Multiple Pattern Matching (Q5088902) (← links)
- (Q5088917) (← links)
- (Q5091046) (← links)
- (Q5091063) (← links)
- Faster Practical Block Compression for Rank/Select Dictionaries (Q5150935) (← links)
- Optimal Skeleton Huffman Trees (Q5150936) (← links)
- Practical Compact Indexes for Top-<i>k</i>Document Retrieval (Q5270942) (← links)
- m-Bonsai: A Practical Compact Dynamic Trie (Q5384619) (← links)
- Forward looking Huffman coding (Q5918359) (← links)
- Fast and compact planar embeddings (Q5918983) (← links)
- Compact representations of spatial hierarchical structures with support for topological queries (Q6040665) (← links)
- Enumerating Range Modes (Q6065431) (← links)
- On representing the degree sequences of sublogarithmic-degree Wheeler graphs (Q6111590) (← links)
- Space-efficient data structure for next/previous larger/smaller value queries (Q6163965) (← links)
- Succinct data structure for path graphs (Q6178455) (← links)
- Constructing and indexing the bijective and extended Burrows-Wheeler transform (Q6204171) (← links)