Encoding range minima and range top-2 queries
From MaRDI portal
Publication:2955625
DOI10.1098/rsta.2013.0131zbMath1353.68059OpenAlexW2021693648WikidataQ50121786 ScholiaQ50121786MaRDI QIDQ2955625
Pooya Davoodi, Rajeev Raman, S. Srinivasa Rao, Gonzalo Navarro
Publication date: 13 January 2017
Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1098/rsta.2013.0131
Related Items
On succinct representations of binary trees ⋮ Optimal Encodings for Range Top-$$k$$, Selection, and Min-Max ⋮ Encoding two-dimensional range top-\(k\) queries ⋮ Encoding Nearest Larger Values ⋮ Encoding nearest larger values ⋮ The effective entropy of next/previous larger/smaller value queries ⋮ Unnamed Item ⋮ An Encoding for Order-Preserving Matching.
Cites Work
- Ultra-succinct representation of ordered trees with applications
- A uniform paradigm to succinctly encode various families of trees
- Succinct ordinal trees with level-ancestor queries
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- A unifying look at data structures
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
This page was built for publication: Encoding range minima and range top-2 queries
