Improved range minimum queries
From MaRDI portal
Publication:2397152
DOI10.1016/J.JDA.2016.09.002zbMATH Open1409.68078OpenAlexW2532601525MaRDI QIDQ2397152FDOQ2397152
Authors: Héctor Ferrada, Gonzalo Navarro 
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
Recommendations
- Practical range minimum queries revisited
- Range minimum queries in minimal space
- Improved range searching lower bounds
- Range minimum query indexes in higher dimensions
- Optimal succinctness for range minimum queries
- Efficient dynamic range minimum query
- I/O-efficient range minima queries
- Lower bound for succinct range minimum query
range minimum querieslowest common ancestorscompact data structuresCartesian treesbalanced parentheses
Cites Work
- Succinct representation of balanced parentheses and static trees
- Fully functional static and dynamic succinct trees
- Recursive Star-Tree Parallel Data Structure
- Ultra-succinct representation of ordered trees with applications
- Title not available (Why is that?)
- Succinct Trees in Practice
- Representing trees of higher degree
- Compressed suffix trees with full functionality
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Succinct data structures for flexible text retrieval systems
- A unifying look at data structures
- Space-efficient data-analysis queries on grids
- Faster entropy-bounded compressed suffix trees
- Lempel-Ziv factorization using less time \& space
- A simple optimal representation for balanced parentheses
Cited In (15)
- Dualities in tree representations
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
- Property Suffix Array with Applications in Indexing Weighted Sequences
- Space-efficient data structure for next/previous larger/smaller value queries
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- Optimal succinctness for range minimum queries
- How to answer a small batch of RMQs or LCA queries in practice
- Succinct representations of binary trees for range minimum queries
- Range minimum queries in minimal space
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Practical range minimum queries revisited
- Lempel-Ziv compressed structures for document retrieval
- Efficient dynamic range minimum query
- On Cartesian trees and range minimum queries
This page was built for publication: Improved range minimum queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397152)
