Encoding two-dimensional range top-\(k\) queries

DOI10.1007/s00453-021-00856-1OpenAlexW3184010519MaRDI QIDQ2665908

Rahul Lingala, Srinivasa Rao Satti, Seungbum Jo

Publication date: 19 November 2021

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.07067

zbMATH Keywords

range minimum queryencoding modeltop-\(k\) query

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Finding range minima in the middle: approximations and applications
• On space efficient two dimensional range minimum data structures
• Encoding 2D range maximum queries
• An optimal algorithm for selection in a min-heap
• Succinct Representation of Balanced Parentheses and Static Trees
• Succinct and Implicit Data Structures for Computational Geometry
• The Encoding Complexity of Two Dimensional Range Minimum Data Structures
• Encodings for Range Selection and Top-k Queries
• Encodings of Range Maximum-Sum Segment Queries and Applications
• Encoding range minima and range top-2 queries
• Optimal Encodings for Range Top-$$k$$, Selection, and Min-Max
• Online Sorted Range Reporting
• Recursive Star-Tree Parallel Data Structure
• Asymptotically Optimal Encodings of Range Data Structures for Selection and Top- k Queries
• Encoding Two-Dimensional Range Top-k Queries

This page was built for publication: Encoding two-dimensional range top-\(k\) queries