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 50 items.
- Document retrieval with one wildcard (Q287451) (← links)
- Simultaneous encodings for range and next/previous larger/smaller value queries (Q344773) (← links)
- Compressed property suffix trees (Q386003) (← links)
- Entropy-bounded representation of point grids (Q390358) (← links)
- Succinct encoding of arbitrary graphs (Q391972) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Top-\(k\) document retrieval in optimal space (Q396625) (← links)
- Various improvements to text fingerprinting (Q396662) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Optimal indexes for sparse bit vectors (Q472491) (← links)
- Improved space-time tradeoffs for approximate full-text indexing with one edit error (Q494804) (← links)
- I/O-efficient path traversal in succinct planar graphs (Q521807) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- Selection from read-only memory with limited workspace (Q744087) (← links)
- Compact and succinct data structures for multidimensional orthogonal range searching (Q776842) (← links)
- Tree path majority data structures (Q784481) (← links)
- Lyndon array construction during Burrows-Wheeler inversion (Q1632505) (← links)
- Fixed block compression boosting in FM-indexes: theory and practice (Q1739099) (← links)
- Approximate query processing over static sets and sliding windows (Q1981762) (← links)
- Top tree compression of tries (Q2067669) (← 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)
- Space efficient merging of de Bruijn graphs and Wheeler graphs (Q2118200) (← links)
- Adaptive succinctness (Q2118203) (← links)
- Enumeration of maximal common subsequences between two strings (Q2118209) (← links)
- An LMS-based grammar self-index with local consistency properties (Q2146131) (← links)
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs (Q2150567) (← links)
- Using compressed suffix-arrays for a compact representation of temporal-graphs (Q2200556) (← links)
- Optimal skeleton and reduced Huffman trees (Q2220839) (← links)
- Block trees (Q2221797) (← links)
- Succinct representations for (non)deterministic finite automata (Q2232264) (← links)
- Lempel-Ziv compressed structures for document retrieval (Q2272976) (← links)
- Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster (Q2300733) (← links)
- Space-efficient fully dynamic DFS in undirected graphs (Q2312405) (← links)
- DenseZDD: a compact and fast index for families of sets (Q2331660) (← links)
- On hardness of several string indexing problems (Q2342674) (← links)
- Top-\(k\) term-proximity in succinct space (Q2362352) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- Block graphs in practice (Q2363994) (← links)
- Range selection and predecessor queries in data aware space and time (Q2397147) (← links)
- On the succinct representation of equivalence classes (Q2408100) (← links)
- Succinct data structure for dynamic trees with faster queries (Q2420610) (← links)
- Succinct representation of labeled graphs (Q2428673) (← links)
- Succinct and I/O efficient data structures for traversal in trees (Q2429347) (← links)
- A uniform paradigm to succinctly encode various families of trees (Q2441590) (← links)
- Minimal indices for predecessor search (Q2514143) (← links)
- Space efficient data structures for nearest larger neighbor (Q2634717) (← links)
- Representation of ordered trees with a given degree distribution (Q2656174) (← links)
