Encodings for range minimum queries over bounded alphabets
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 7651115 (Why is no real title available?)
- scientific article; zbMATH DE number 7740925 (Why is no real title available?)
- A unifying look at data structures
- Asymptotic enumeration of compacted binary trees of bounded right height
- Changing base without losing space
- Compressed range minimum queries
- Data structures for efficient string algorithms.
- Data structures for range minimum queries in multidimensional arrays
- Encoding 2D range maximum queries
- Encoding nearest larger values
- Fast Algorithms for Finding Nearest Common Ancestors
- Full-fledged real-time indexing for constant size alphabets
- Fully functional suffix trees and optimal text searching in BWT-runs bounded space
- Note on the number of minimal lattice paths restricted by two parallel lines
- On Cartesian Trees and Range Minimum Queries
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- On space efficient two dimensional range minimum data structures
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- String Processing and Information Retrieval
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Succinct representations of binary trees for range minimum queries
- The Encoding Complexity of Two Dimensional Range Minimum Data Structures
- The level ancestor problem simplified
- Two dimensional range minimum queries and Fibonacci lattices
- Wavelet trees for all
This page was built for publication: Encodings for range minimum queries over bounded alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6841374)
