Data structures for range median queries

DOI10.1007/978-3-642-10631-6_83MaRDI QIDQ3652268zbMATH OpenOpenAlexFDO

Authors Gerth Stølting Brodal, Allan Grønlund Jørgensen

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

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Towards optimal range medians
• Range selection and median: tight cell probe lower bounds and adaptive data structures
• Towards Optimal Range Medians
• Range Medians
• STACS 2005

Cited in

(15)

• The heaviest induced ancestors problem: better data structures and applications
• Linear-space data structures for range mode query in arrays
• Range selection and predecessor queries in data aware space and time
• Array range queries
• Range Medians
• Towards Optimal Range Medians
• Space-efficient data-analysis queries on grids
• New algorithms on wavelet trees and applications to information retrieval
• The heaviest induced ancestors problem revisited
• Algorithms and Computation
• Range selection and median: tight cell probe lower bounds and adaptive data structures
• Towards optimal range medians
• scientific article; zbMATH DE number 2226802 (Why is no real title available?)
• STACS 2005
• Grandchildren-weight-balanced binary search trees

This page was built for publication: Data structures for range median queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652268)