Recommendations
- Encoding nearest larger values
- Efficient coding of approximations of real numbers
- Optimal Binary Coding of Ordered Numbers
- scientific article; zbMATH DE number 4133978
- An optimum encoding with minimum longest code and total number of digits
- Endcoding Complexity Versus Minimum Distance
- Encoding the information in relative parameters
Cites work
- A uniform paradigm to succinctly encode various families of trees
- Combined data structure for previous- and next-smaller-values
- Compact encodings and indexes for the nearest larger neighbor problem
- Encoding range minima and range top-2 queries
- Faster entropy-bounded compressed suffix trees
- Finding Nearest Larger Neighbors
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
- Space efficient data structures for nearest larger neighbor
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Time-space tradeoffs for all-nearest-larger-neighbors problems
Cited in
(6)- Encoding nearest larger values
- The effective entropy of next/previous larger/smaller value queries
- Space efficient data structures for nearest larger neighbor
- Space efficient data structures for nearest larger neighbor
- Improved algorithms for the range next value problem and applications
- Compact encodings and indexes for the nearest larger neighbor problem
This page was built for publication: Encoding Nearest Larger Values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942276)
