Representing trees of higher degree
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4103101
- Tree representations of graphs
- Higher Dimensional Trees, Algebraically
- scientific article; zbMATH DE number 708666
- Representation of ordered trees with a given degree distribution
- Representability of trees and some of their applications
- scientific article; zbMATH DE number 1420489
- High degrees in recursive trees
- scientific article; zbMATH DE number 1696804
- Representations of infinite tree sets
Cited in
(64)- Path queries on functions
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Top tree compression of tries
- Space-efficient construction of compressed suffix trees
- Lempel-Ziv compressed structures for document retrieval
- Tree compression with top trees
- On succinct representations of binary trees
- Succinct representations of weighted trees supporting path queries
- Improved range minimum queries
- On the succinct representation of equivalence classes
- Succinct data structure for dynamic trees with faster queries
- Stronger Lempel-Ziv based compressed text indexing
- Succinct representation of labeled graphs
- Succinct and I/O efficient data structures for traversal in trees
- A uniform paradigm to succinctly encode various families of trees
- Adaptive searching in succinctly encoded binary relations and tree-structured documents
- Rank and select revisited and extended
- Succinct dynamic cardinal trees
- GLOUDS: representing tree-like graphs
- Grammar-compressed indexes with logarithmic search time
- Representation of ordered trees with a given degree distribution
- Fully functional static and dynamic succinct trees
- Fast compressed tries through path decompositions
- General document retrieval in compact space
- Succinct representations of ordinal trees
- Lempel Ziv computation in small space (LZ-CISS)
- Succinct dynamic cardinal trees with constant time operations for small alphabet
- Self-indexing based on LZ77
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Self-indexed Text Compression Using Straight-Line Programs
- Succinct oblivious RAM
- scientific article; zbMATH DE number 3876615 (Why is no real title available?)
- A Uniform Approach Towards Succinct Representation of Trees
- Faster and Space-Optimal Edit Distance “1” Dictionary
- Succinct representations of trees
- On compressing and indexing repetitive sequences
- Reduced representations of rooted trees.
- Ultra-succinct representation of ordered trees with applications
- Succinct representations of permutations and functions
- Succinct representation of labeled trees
- A framework for succinct labeled ordinal trees over large alphabets
- Simple and efficient fully-functional succinct trees
- Optimal rank and select queries on dictionary-compressed text
- Engineering practical Lempel-Ziv tries
- Recent developments in floorplan representations
- Dualities in tree representations
- Practical compact indexes for top-k document retrieval
- Combined data structure for previous- and next-smaller-values
- m-Bonsai: a practical compact dynamic trie
- Succinct Representation of Labeled Graphs
- Succinct representation of dynamic trees
- Space-efficient construction of Lempel-Ziv compressed text indexes
- scientific article; zbMATH DE number 7765383 (Why is no real title available?)
- Space-efficient data structure for next/previous larger/smaller value queries
- Faster dynamic compressed \(d\)-ary relations
- Engineering a textbook approach to index massive string dictionaries
- Space-efficient data structure for next/previous larger/smaller value queries
- (Worst-case) optimal adaptive dynamic bitvectors
- Lempel-Ziv factorization powered by space efficient suffix trees
- A simple representation of tree covering utilizing balanced parentheses and efficient implementation of average-case optimal RMQs
- Succinct preferential-attachment graphs
- A simple optimal representation for balanced parentheses
- Quad-k d trees: a general framework for k d trees and quad trees
- On compact representations of all-pairs-shortest-path-distance matrices
This page was built for publication: Representing trees of higher degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818675)
