Recommendations
Cites work
- scientific article; zbMATH DE number 5485435 (Why is no real title available?)
- scientific article; zbMATH DE number 3551889 (Why is no real title available?)
- scientific article; zbMATH DE number 3551902 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- scientific article; zbMATH DE number 2226802 (Why is no real title available?)
- An Online Algorithm for Finding the Longest Previous Factors
- Data structures for range median queries
- Deferred Data Structuring
- Design and implementation of an efficient priority queue
- Fractional cascading. I: A data structuring technique
- Improved Bounds for Range Mode and Range Median Queries
- Merging multiple lists on hierarchical-memory multiprocessors
- On the Complexity of Maintaining Partial Sums
- Optimal External Memory Interval Management
- Optimal bounds for the predecessor problem and related problems
- Orthogonal range searching in linear and almost-linear space
- 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
- Towards Optimal Range Medians
Cited in
(21)- Linear-space data structures for range frequency queries on arrays and trees
- Colored range queries and document retrieval
- Improved Bounds for Range Mode and Range Median Queries
- Range mode and range median queries in constant time and sub-quadratic space
- Data structures for range median queries
- New algorithms on wavelet trees and applications to information retrieval
- Array range queries
- Range selection and median: tight cell probe lower bounds and adaptive data structures
- 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
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Dynamic path queries in linear space
- 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
- Towards Optimal Range Medians
- Range Medians
- Improved time and space bounds for dynamic range mode
- Indexing for summary queries
- Optimal encodings for range top-\(k\), selection, and min-max
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)
