Finding percentile elements

Dorit Dor, Uri Zwick

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We describe an algorithm for selecting the αn-th largest element (where 0<α<1), out of a totally ordered set of n elements, using at most (1+(1+o(1))H(α))·n comparisons, where H(α) is the binary entropy function and the o(1) stands for a function that tends to 0 as α tends to 0. This, for small α's, is almost best possible as there is a lower bound of about (1+H(α))·n comparisons. The algorithm obtained beats the global 3n upper bound of Schonhage, Paterson and Pippenger (1976) for α<1/3.

Original languageEnglish
Title of host publicationProceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages88-97
Number of pages10
ISBN (Electronic)0818669152, 9780818669156
DOIs
StatePublished - 1995
Event3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995 - Tel Aviv, Israel
Duration: 4 Jan 19956 Jan 1995

Publication series

NameProceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems

Conference

Conference3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995
Country/TerritoryIsrael
CityTel Aviv
Period4/01/956/01/95

Fingerprint

Dive into the research topics of 'Finding percentile elements'. Together they form a unique fingerprint.

Cite this