Succinct representations of binary trees for range minimum queries
From MaRDI portal
Recommendations
Cited in
(21)- Box-trees and R-trees with near-optimal query time
- Space-efficient algorithms for computing minimal/shortest unique substrings
- Linear-space data structures for range mode query in arrays
- On succinct representations of binary trees
- Building Cartesian trees from free trees with \(k\) leaves
- Linear-space data structures for range frequency queries on arrays and trees
- GLOUDS: representing tree-like graphs
- Space efficient data structures for nearest larger neighbor
- Fully functional static and dynamic succinct trees
- Fast compressed tries through path decompositions
- Orthogonal range searching for text indexing
- Space efficient data structures for nearest larger neighbor
- Two dimensional range minimum queries and Fibonacci lattices
- On Cartesian Trees and Range Minimum Queries
- Efficient dynamic range minimum query
- On Cartesian trees and range minimum queries
- Box-trees and R-trees with near-optimal query time
- Discrete range searching primitive for the GPU and its applications
- Compact data structures for shortest unique substring queries
- Encodings for range minimum queries over bounded alphabets
- Encodings for range minimum queries over bounded alphabets
This page was built for publication: Succinct representations of binary trees for range minimum queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914344)
