Online Sorted Range Reporting

DOI10.1007/978-3-642-10631-6_19zbMath1272.68113OpenAlexW1571941879MaRDI QIDQ3652203

Gerth Stølting Brodal, Mark Greve, Rolf Fagerberg, Alejandro López-Ortiz

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_19

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (13)

Optimal encodings for range majority queries ⋮ Space-efficient indexes for forbidden extension queries ⋮ String indexing for top-\(k\) close consecutive occurrences ⋮ Encoding two-dimensional range top-\(k\) queries ⋮ Finding top-\(k\) longest palindromes in substrings ⋮ Unnamed Item ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ Succinct non-overlapping indexing ⋮ Efficient Top-k Queries for Orthogonal Ranges ⋮ Smallest \(k\)-enclosing rectangle revisited ⋮ Bicriteria Data Compression ⋮ Array Range Queries ⋮ Unnamed Item

This page was built for publication: Online Sorted Range Reporting