Tree path majority data structures
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1947405 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- scientific article; zbMATH DE number 2226802 (Why is no real title available?)
- A data structure for dynamic trees
- A framework for succinct labeled ordinal trees over large alphabets
- Alphabet-independent compressed text indexing
- Better space bounds for parameterized range majority and minority
- Computing on a free tree via complexity-preserving mappings
- Finding repeated elements
- Fully compressed suffix trees
- Fully functional static and dynamic succinct trees
- Linear-space data structures for range frequency queries on arrays and trees
- Linear-space data structures for range minority query in arrays
- Linear-space data structures for range mode query in arrays
- Lowest common ancestors in trees and directed acyclic graphs
- Optimal lower and upper bounds for representing sequences
- Path queries on functions
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Succinct indices for path minimum, with applications
- Succinct representation of labeled trees
- The level ancestor problem simplified
This page was built for publication: Tree path majority data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q784481)