Encoding Nearest Larger Values

DOI10.1007/978-3-319-19929-0_33MaRDI QIDQ2942276zbMATH OpenOpenAlexFDO

Authors Patrick K. Nicholson, Rajeev Raman

Publication date 20 August 2015

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2381/39591

Mathematics Subject Classification ID

Data structures (68P05)

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)

• The effective entropy of next/previous larger/smaller value queries
• Encoding nearest larger values
• Improved algorithms for the range next value problem and applications
• Space efficient data structures for nearest larger neighbor
• Compact encodings and indexes for the nearest larger neighbor problem
• Space efficient data structures for nearest larger neighbor

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)