TY - GEN

T1 - Finding percentile elements

AU - Dor, Dorit

AU - Zwick, Uri

N1 - Publisher Copyright:
© 1995 IEEE.

PY - 1995

Y1 - 1995

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

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

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

U2 - 10.1109/ISTCS.1995.377042

DO - 10.1109/ISTCS.1995.377042

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85039786450

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

SP - 88

EP - 97

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

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 4 January 1995 through 6 January 1995

ER -