Towards optimal range medians
From MaRDI portal
Publication:541663
DOI10.1016/J.TCS.2010.05.003zbMATH Open1220.68052OpenAlexW2571362173MaRDI QIDQ541663FDOQ541663
Peter Sanders, Beat Gfeller, Allan Grønlund Jørgensen, Gerth Stølting Brodal
Publication date: 7 June 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.003
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards Optimal Range Medians
- Range mode and range median queries in constant time and sub-quadratic space
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
- Design and implementation of an efficient priority queue
- Optimal External Memory Interval Management
- Optimal bounds for the predecessor problem and related problems
- Orthogonal range searching in linear and almost-linear space
- Fractional cascading. I: A data structuring technique
- An Online Algorithm for Finding the Longest Previous Factors
- Data Structures for Range Median Queries
- Range Medians
- On the Complexity of Maintaining Partial Sums
- Improved Bounds for Range Mode and Range Median Queries
- Merging multiple lists on hierarchical-memory multiprocessors
- Deferred Data Structuring
Cited In (15)
- Linear-space data structures for range frequency queries on arrays and trees
- Colored range queries and document retrieval
- Spaces, Trees, and Colors
- Optimal Encodings for Range Top-$$k$$, Selection, and Min-Max
- New algorithms on wavelet trees and applications to information retrieval
- Improved Time and Space Bounds for Dynamic Range Mode
- Linear-space data structures for range mode query in arrays
- Compact binary relation representations with rich functionality
- The optimal statistical median of a convex set of arrays
- Dynamic path queries in linear space
- Array Range Queries
- Range selection and predecessor queries in data aware space and time
- Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds
- Linear-space data structures for range minority query in arrays
- Indexing for summary queries
This page was built for publication: Towards optimal range medians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q541663)
