Data Structures for Range Median Queries
From MaRDI portal
Publication:3652268
DOI10.1007/978-3-642-10631-6_83zbMath1273.68096OpenAlexW63020610MaRDI QIDQ3652268
Allan Grønlund Jørgensen, Gerth Stølting Brodal
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_83
Related Items
The heaviest induced ancestors problem: better data structures and applications ⋮ Range selection and predecessor queries in data aware space and time ⋮ Space-efficient data-analysis queries on grids ⋮ New algorithms on wavelet trees and applications to information retrieval ⋮ Linear-space data structures for range mode query in arrays ⋮ Towards optimal range medians ⋮ Array Range Queries ⋮ The Heaviest Induced Ancestors Problem Revisited
This page was built for publication: Data Structures for Range Median Queries
