Practical range minimum queries revisited
From MaRDI portal
Publication:4580157
DOI10.4230/LIPICS.SEA.2017.12zbMATH Open1432.68081OpenAlexW2753181597MaRDI QIDQ4580157FDOQ4580157
Authors: Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit 
Publication date: 13 August 2018
Full work available at URL: https://doi.org/10.4230/LIPIcs.SEA.2017.12
Recommendations
- Improved range minimum queries
- Optimal succinctness for range minimum queries
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
Cited In (12)
- Two-Dimensional Range Minimum Queries
- Property Suffix Array with Applications in Indexing Weighted Sequences
- On the minimum total length of interval systems expressing all intervals, and range-restricted queries
- 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
- Range minimum queries in minimal space
- Range median of minima queries, super-Cartesian trees, and text indexing
- On Cartesian Trees and Range Minimum Queries
- The Range 1 Query (R1Q) Problem
- Two Dimensional Range Minimum Queries and Fibonacci Lattices
- Improved range minimum queries
This page was built for publication: Practical range minimum queries revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580157)
