Range medians

Sariel Har-Peled, S. Muthukrishnan

    Research output: Chapter in Book/Report/Conference proceedingConference contribution


    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).

    Original languageEnglish (US)
    Title of host publicationAlgorithms - ESA 2008 - 16th Annual European Symposium, Proceedings
    PublisherSpringer Verlag
    Number of pages12
    ISBN (Print)3540877436, 9783540877431
    StatePublished - 2008
    Event16th Annual European Symposium on Algorithms, ESA 2008 - Karlsruhe, Germany
    Duration: Sep 15 2008Sep 17 2008

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume5193 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349


    Other16th Annual European Symposium on Algorithms, ESA 2008

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • General Computer Science


    Dive into the research topics of 'Range medians'. Together they form a unique fingerprint.

    Cite this