Encoding two-dimensional range top-k queries
From MaRDI portal
Publication:5369535
DOI10.4230/LIPICS.CPM.2016.3zbMATH Open1380.68149OpenAlexW2531674969MaRDI QIDQ5369535FDOQ5369535
Authors: Seungbum Jo, Rahul Lingala, Srinivasa Rao Satti
Publication date: 17 October 2017
Full work available at URL: https://doi.org/10.4230/LIPIcs.CPM.2016.3
Recommendations
- Encoding two-dimensional range top-\(k\) queries
- Encoding two-dimensional range top-\(k\) queries revisited
- Encodings for range selection and top-\(k\) queries
- Optimal encodings for range top-\(k\), selection, and min-max
- Asymptotically optimal encodings of range data structures for selection and top-\(k\) queries
Cited In (7)
- The effective entropy of next/previous larger/smaller value queries
- Asymptotically optimal encodings of range data structures for selection and top-\(k\) queries
- Encoding two-dimensional range top-\(k\) queries revisited
- Encodings for range selection and top-\(k\) queries
- Asymptotically optimal encodings for range selection
- The Encoding Complexity of Two Dimensional Range Minimum Data Structures
- Encoding two-dimensional range top-\(k\) queries
This page was built for publication: Encoding two-dimensional range top-\(k\) queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5369535)