Finding the median requires 2n comparisons
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Roughly sorting: sequential and parallel approach
Journal of Information Processing
Randomized algorithms
SIAM Journal on Computing
Space-efficient online computation of quantile summaries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Median Selection Requires $(2+\epsilon)n$ Comparisons
SIAM Journal on Discrete Mathematics
Space-time tradeoff for answering range queries (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The level ancestor problem simplified
Theoretical Computer Science - Latin American theorotical informatics
Power-conserving computation of order-statistics over sensor networks
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Range mode and range median queries on lists and trees
Nordic Journal of Computing
Checks and balances: monitoring data quality problems in network traffic databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Approximate range mode and range median queries
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Range Quantile Queries: Another Virtue of Wavelet Trees
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Data Structures for Range Median Queries
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Range selection and median: tight cell probe lower bounds and adaptive data structures
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
New algorithms on wavelet trees and applications to information retrieval
Theoretical Computer Science
Dynamic range selection in linear space
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.00 |
We study a generalization of the classical median finding problem to batched query case: given an array of unsorted nitems and k(not necessarily disjoint) intervals in the array, the goal is to determine the median in eachof the intervals in the array. We give an algorithm that uses O(nlogk+ klogklogn) comparisons and show a lower bound of 茂戮驴(nlogk) comparisons for this problem. This is optimal for k= O(n/logn).