Pages that link to "Item:Q2799480"
From MaRDI portal
The following pages link to Fully Functional Static and Dynamic Succinct Trees (Q2799480):
Displaying 50 items.
- Succinct dynamic cardinal trees (Q262263) (← links)
- Fast construction of wavelet trees (Q294942) (← links)
- Compact binary relation representations with rich functionality (Q386006) (← links)
- Succinct representation of labeled trees (Q476876) (← links)
- A framework for succinct labeled ordinal trees over large alphabets (Q487027) (← links)
- Simple and efficient fully-functional succinct trees (Q507389) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Constant-time tree traversal and subtree equality check for grammar-compressed trees (Q724220) (← links)
- Compact representation of graphs of small clique-width (Q724221) (← links)
- Constant delay traversal of grammar-compressed graphs with bounded rank (Q776844) (← links)
- Tree path majority data structures (Q784481) (← links)
- Lyndon array construction during Burrows-Wheeler inversion (Q1632505) (← links)
- A faster implementation of online RLBWT and its application to LZ77 parsing (Q1711660) (← links)
- Path queries on functions (Q1740690) (← links)
- Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
- Dynamic path queries in linear space (Q1799220) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- Succinct representation for (non)deterministic finite automata (Q2084735) (← links)
- Faster compressed quadtrees (Q2084740) (← links)
- Navigating planar topologies in near-optimal space and time (Q2096370) (← links)
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs (Q2150567) (← links)
- Practical space-efficient index for structural pattern matching (Q2169971) (← links)
- Compressed dynamic range majority and minority data structures (Q2182101) (← links)
- Block trees (Q2221797) (← links)
- Succinct representations for (non)deterministic finite automata (Q2232264) (← links)
- Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures (Q2235767) (← links)
- Lempel-Ziv compressed structures for document retrieval (Q2272976) (← links)
- Ranked document selection (Q2297857) (← links)
- DenseZDD: a compact and fast index for families of sets (Q2331660) (← links)
- On succinct representations of binary trees (Q2363992) (← links)
- Improved range minimum queries (Q2397152) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- Succinct data structure for dynamic trees with faster queries (Q2420610) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
- Representation of ordered trees with a given degree distribution (Q2656174) (← links)
- 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)
- Lempel Ziv Computation in Small Space (LZ-CISS) (Q2942255) (← links)
- Faster Lightweight Lempel-Ziv Parsing (Q2946413) (← links)
- A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs (Q2980917) (← links)
- (Q3304151) (← links)
- Compressed Data Structures for Dynamic Sequences (Q3452849) (← links)
- (Q5088898) (← links)
- Compressed Multiple Pattern Matching (Q5088902) (← links)
- (Q5088917) (← links)
- (Q5091062) (← links)
- (Q5091063) (← links)
- Engineering Practical Lempel-Ziv Tries (Q5102060) (← links)
