On the performance of learned data structures
From MaRDI portal
Recommendations
Cites work
- A guide to first-passage processes
- A “Learned” Approach to Quicken and Compress Rank/Select Dictionaries
- An on-line algorithm for fitting straight lines between data ranges
- Approximating points by a piecewise linear function
- Handbook of stochastic methods for physics, chemistry and natural sciences.
- scientific article; zbMATH DE number 1026574 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 3255204 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
Cited in
(7)- Efficient learning in adaptive processing of data structures
- Machine learning advised algorithms for the ski rental problem with a discount
- On data and algorithms: Understanding inductive performance
- FL-RMQ: a learned approach to range minimum queries
- Efficiency of learned indexes on genome spectra
- A dynamic piecewise-linear geometric index with worst-case guarantees
- Compressibility measures and succinct data structures for piecewise linear approximations
This page was built for publication: On the performance of learned data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2031054)