Improved range minimum queries
From MaRDI portal
Publication:2397152
DOI10.1016/j.jda.2016.09.002zbMath1409.68078OpenAlexW2532601525MaRDI QIDQ2397152
Gonzalo Navarro, Héctor Ferrada
Publication date: 29 May 2017
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2016.09.002
range minimum querieslowest common ancestorscompact data structuresCartesian treesbalanced parentheses
Related Items (6)
Property Suffix Array with Applications in Indexing Weighted Sequences ⋮ Space-efficient data structure for next/previous larger/smaller value queries ⋮ Practical Performance of Space Efficient Data Structures for Longest Common Extensions. ⋮ Lempel-Ziv compressed structures for document retrieval ⋮ Unnamed Item ⋮ Range minimum queries in minimal space
Cites Work
- Unnamed Item
- Space-efficient data-analysis queries on grids
- Ultra-succinct representation of ordered trees with applications
- Representing trees of higher degree
- A simple optimal representation for balanced parentheses
- Succinct data structures for flexible text retrieval systems
- Lempel-Ziv factorization using less time \& space
- Faster entropy-bounded compressed suffix trees
- Compressed suffix trees with full functionality
- Succinct Representation of Balanced Parentheses and Static Trees
- Fully Functional Static and Dynamic Succinct Trees
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- A unifying look at data structures
- Recursive Star-Tree Parallel Data Structure
- Succinct Trees in Practice
This page was built for publication: Improved range minimum queries
