Asymptotically Optimal Encodings of Range Data Structures for Selection and Top- k Queries

DOI10.1145/3012939zbMath1445.68067OpenAlexW2592486490MaRDI QIDQ4962658

John Iacono, Roberto Grossi, Srinivasa Rao Satti, Rajeev Raman, Gonzalo Navarro

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3012939

zbMATH Keywords

encoding data structuressuccinct data structuresrange minimum queriesrange search data structures

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (5)

Encoding two-dimensional range top-\(k\) queries ⋮ Reverse-Safe Text Indexing ⋮ The effective entropy of next/previous larger/smaller value queries ⋮ Path queries on functions ⋮ Unnamed Item

This page was built for publication: Asymptotically Optimal Encodings of Range Data Structures for Selection and Top- k Queries