Abstract
We study a generalization of the classical median finding problem to batched query case: given an array of unsorted n items and k (not necessarily disjoint) intervals in the array, the goal is to determine the median in each of the intervals in the array. We give an algorithm that uses O(nlogk + klogk logn) comparisons and show a lower bound of Ω(nlogk) comparisons for this problem. This is optimal for k = O(n/logn). © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Har-Peled, S., & Muthukrishnan, S. (2008). Range medians. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 503–514). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
