scientific article; zbMATH DE number 6783434

zbMath1373.68196MaRDI QIDQ5365082

Allan Grønlund Jørgensen, Kasper Green Larsen

Publication date: 29 September 2017

Full work available at URL: http://dl.acm.org/citation.cfm?id=2133099

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (19)

Optimal Encodings for Range Top-$$k$$, Selection, and Min-Max ⋮ Range selection and predecessor queries in data aware space and time ⋮ Indexing for summary queries ⋮ Efficient range searching for categorical and plain data ⋮ Compact binary relation representations with rich functionality ⋮ New algorithms on wavelet trees and applications to information retrieval ⋮ Random access in persistent strings and segment selection ⋮ Adaptive data structures for 2D dominance colored range counting ⋮ Unnamed Item ⋮ Wavelet trees for all ⋮ Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds ⋮ Linear-space data structures for range minority query in arrays ⋮ Linear-space data structures for range mode query in arrays ⋮ Spaces, Trees, and Colors ⋮ Smallest \(k\)-enclosing rectangle revisited ⋮ Ranked document selection ⋮ Smallest k-enclosing rectangle revisited ⋮ Array Range Queries ⋮ Linear-space data structures for range frequency queries on arrays and trees

This page was built for publication: