Efficient dynamic range minimum query
From MaRDI portal
Publication:507385
DOI10.1016/J.TCS.2016.07.002zbMATH Open1356.68049OpenAlexW2237894741MaRDI QIDQ507385FDOQ507385
Authors: Alice Héliou, M. Léonard, L. Mouchard, M. Salson 
Publication date: 6 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.07.002
Recommendations
Cites Work
- Succinct representations of binary trees for range minimum queries
- Optimal succinctness for range minimum queries
- Parallelism in Comparison Problems
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Compressed suffix trees with full functionality
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Practical entropy-compressed rank/select dictionary
- Finding the maximum, merging, and sorting in a parallel computation model
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- Rank and select revisited and extended
- Compressed data structures: Dictionaries and data-aware measures
- On (dynamic) range minimum queries in external memory
- Path minima queries in dynamic weighted trees
Cited In (8)
- Faster online computation of the succinct longest previous factor array
- On (dynamic) range minimum queries in external memory
- Improved algorithms for the range next value problem and applications
- Processing an offline insertion-query sequence with applications
- Online sorted range reporting
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- I/O-efficient range minima queries
- Improved range minimum queries
This page was built for publication: Efficient dynamic range minimum query
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507385)
