Range medians

Sariel Har-Peled, Shanmugavelayutham Muthukrishnan

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

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

    Original languageEnglish (US)
    Title of host publicationAlgorithms - ESA 2008 - 16th Annual European Symposium, Proceedings
    Pages503-514
    Number of pages12
    DOIs
    StatePublished - Dec 24 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

    Other

    Other16th Annual European Symposium on Algorithms, ESA 2008
    CountryGermany
    CityKarlsruhe
    Period9/15/089/17/08

    Fingerprint

    Range of data
    Interval
    Disjoint
    Query
    Lower bound
    Generalization

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Har-Peled, S., & Muthukrishnan, S. (2008). Range medians. In Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings (pp. 503-514). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5193 LNCS). https://doi.org/10.1007/978-3-540-87744-8-42

    Range medians. / Har-Peled, Sariel; Muthukrishnan, Shanmugavelayutham.

    Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings. 2008. p. 503-514 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5193 LNCS).

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

    Har-Peled, S & Muthukrishnan, S 2008, Range medians. in Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5193 LNCS, pp. 503-514, 16th Annual European Symposium on Algorithms, ESA 2008, Karlsruhe, Germany, 9/15/08. https://doi.org/10.1007/978-3-540-87744-8-42
    Har-Peled S, Muthukrishnan S. Range medians. In Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings. 2008. p. 503-514. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-87744-8-42
    Har-Peled, Sariel ; Muthukrishnan, Shanmugavelayutham. / Range medians. Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings. 2008. pp. 503-514 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{3415a2494ef741379b4ffcec954f9be0,
    title = "Range medians",
    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).",
    author = "Sariel Har-Peled and Shanmugavelayutham Muthukrishnan",
    year = "2008",
    month = "12",
    day = "24",
    doi = "10.1007/978-3-540-87744-8-42",
    language = "English (US)",
    isbn = "3540877436",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "503--514",
    booktitle = "Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings",

    }

    TY - GEN

    T1 - Range medians

    AU - Har-Peled, Sariel

    AU - Muthukrishnan, Shanmugavelayutham

    PY - 2008/12/24

    Y1 - 2008/12/24

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

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

    UR - http://www.scopus.com/inward/record.url?scp=57749083049&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=57749083049&partnerID=8YFLogxK

    U2 - 10.1007/978-3-540-87744-8-42

    DO - 10.1007/978-3-540-87744-8-42

    M3 - Conference contribution

    SN - 3540877436

    SN - 9783540877431

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 503

    EP - 514

    BT - Algorithms - ESA 2008 - 16th Annual European Symposium, Proceedings

    ER -