The following pages link to Representing trees of higher degree (Q818675):
Displayed 50 items.
- Succinct dynamic cardinal trees (Q262263) (← links)
- Simultaneous encodings for range and next/previous larger/smaller value queries (Q344773) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
- Succinct representations of permutations and functions (Q441860) (← 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)
- Combined data structure for previous- and next-smaller-values (Q533896) (← links)
- Succinct representation of dynamic trees (Q541673) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- A simple optimal representation for balanced parentheses (Q859854) (← links)
- Encoding 2D range maximum queries (Q897899) (← links)
- Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees (Q906406) (← links)
- On compact representations of all-pairs-shortest-path-distance matrices (Q986563) (← links)
- Path queries on functions (Q1740690) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
- Top tree compression of tries (Q2067669) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Lempel-Ziv compressed structures for document retrieval (Q2272976) (← links)
- Tree compression with top trees (Q2347804) (← links)
- On succinct representations of binary trees (Q2363992) (← links)
- Succinct representations of weighted trees supporting path queries (Q2376795) (← links)
- Improved range minimum queries (Q2397152) (← links)
- On the succinct representation of equivalence classes (Q2408100) (← links)
- Succinct data structure for dynamic trees with faster queries (Q2420610) (← links)
- Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← 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)
- Adaptive searching in succinctly encoded binary relations and tree-structured documents (Q2465061) (← links)
- Rank and select revisited and extended (Q2465064) (← links)
- GLOUDS: representing tree-like graphs (Q2634715) (← links)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
- Representation of ordered trees with a given degree distribution (Q2656174) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Fast Compressed Tries through Path Decompositions (Q2828185) (← links)
- General Document Retrieval in Compact Space (Q2828189) (← links)
- Succinct Representations of Ordinal Trees (Q2848982) (← links)
- Lempel Ziv Computation in Small Space (LZ-CISS) (Q2942255) (← links)
- Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet (Q3010401) (← links)
- Self-indexing Based on LZ77 (Q3011842) (← links)
- LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations (Q3011862) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
- (Q3304151) (← links)
- A Uniform Approach Towards Succinct Representation of Trees (Q3512457) (← links)
- Faster and Space-Optimal Edit Distance “1” Dictionary (Q3637110) (← links)
- Optimal rank and select queries on dictionary-compressed text (Q5088891) (← links)