Cache oblivious algorithms for the RMQ and the RMSQ problems
From MaRDI portal
Recommendations
Cites work
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- An optimal algorithm for maximum-sum segment and its application in bioinformatics (extended abstract)
- An Optimal Algorithm for the Maximum-Density Segment Problem
- Cache-oblivious algorithms
- Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
- Fast Algorithms for Finding Nearest Common Ancestors
- Finding Patterns in Given Intervals
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- On Cartesian Trees and Range Minimum Queries
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- On the range maximum-sum segment query problem
- Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
- Optimal prefix and suffix queries on texts
- Succinct data structures for flexible text retrieval systems
Cited in
(4)
This page was built for publication: Cache oblivious algorithms for the RMQ and the RMSQ problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626901)