FL-RMQ: a learned approach to range minimum queries

Cites work

A Learned Approach to Design Compressed Rank/Select Data Structures
A simple representation of tree covering utilizing balanced parentheses and efficient implementation of average-case optimal RMQs
A simple storage scheme for strings achieving entropy bounds
A uniform paradigm to succinctly encode various families of trees
A unifying look at data structures
An improved data stream summary: the count-min sketch and its applications
An on-line algorithm for fitting straight lines between data ranges
An Online Algorithm for Finding the Longest Previous Factors
Array layouts for comparison-based searching
Bat-LZ out of hell
Bounded ordered dictionaries in O(log log N) time and O(n) space
Compressed range minimum queries
Compressed suffix trees with full functionality
Efficient pattern matching with scaling
Faster entropy-bounded compressed suffix trees
Fully functional static and dynamic succinct trees
scientific article; zbMATH DE number 1512678 (Why is no real title available?)
scientific article; zbMATH DE number 7740925 (Why is no real title available?)
Improved algorithms for the range next value problem and applications
Improved range minimum queries
Lempel-Ziv factorization using less time \& space
On space efficient two dimensional range minimum data structures
On the performance of learned data structures
PLA-index: a k-mer index exploiting rank curve linearity
Practical range minimum queries revisited
Random access to grammar-compressed strings and trees
Recursive Star-Tree Parallel Data Structure
Space-Efficient Framework for Top-k String Retrieval Problems
Space-efficient preprocessing schemes for range minimum queries on static arrays
Succinct representation of balanced parentheses and static trees
Tree compression with top trees

This page was built for publication: FL-RMQ: a learned approach to range minimum queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299439)