scientific article; zbMATH DE number 7561422
From MaRDI portal
Publication:5091063
DOI10.4230/LIPIcs.ISAAC.2018.68MaRDI QIDQ5091063
Travis Gagie, Meng He, Gonzalo Navarro
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1806.01804
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Linear-space data structures for range frequency queries on arrays and trees
- Succinct representation of labeled trees
- A framework for succinct labeled ordinal trees over large alphabets
- The level ancestor problem simplified
- Finding repeated elements
- A data structure for dynamic trees
- Linear-space data structures for range mode query in arrays
- Fully Functional Static and Dynamic Succinct Trees
- Better Space Bounds for Parameterized Range Majority and Minority
- Fully compressed suffix trees
- Alphabet-Independent Compressed Text Indexing
- Optimal Lower and Upper Bounds for Representing Sequences
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Lowest common ancestors in trees and directed acyclic graphs
This page was built for publication:
