Encoding Nearest Larger Values
From MaRDI portal
Publication:2942276
DOI10.1007/978-3-319-19929-0_33zbMATH Open1432.68100OpenAlexW3122775100MaRDI QIDQ2942276FDOQ2942276
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
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
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
- A uniform paradigm to succinctly encode various families of trees
- Time-space tradeoffs for all-nearest-larger-neighbors problems
- Space efficient data structures for nearest larger neighbor
- Combined data structure for previous- and next-smaller-values
- Faster entropy-bounded compressed suffix trees
- Finding Nearest Larger Neighbors
- Encoding range minima and range top-2 queries
- Compact encodings and indexes for the nearest larger neighbor problem
Cited In (6)
- Space efficient data structures for nearest larger neighbor
- The effective entropy of next/previous larger/smaller value queries
- Compact encodings and indexes for the nearest larger neighbor problem
- Space efficient data structures for nearest larger neighbor
- Improved algorithms for the range next value problem and applications
- Encoding nearest larger values
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)
