Median selection requires (2+ε)n comparisons

Dorit Dor; Uri Zwick

Median selection requires (2+ε)n comparisons

Dorit Dor^*, Uri Zwick

^*Corresponding author for this work

School of Computer Science

Tel Aviv University

Research output: Contribution to journal › Conference article › peer-review

7 Scopus citations

Abstract

Improving a long standing result of Bent and John, we obtain a (2+ε)n lower bound (for some fixed ε>0) on the number of comparisons required, in the worst case, for selecting the median of n elements. The new lower bound is obtained using a weight function that allows us to combine leaf counting and adversary arguments.

Original language	English
Pages (from-to)	125-134
Number of pages	10
Journal	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
State	Published - 1996
Event	Proceedings of the 1996 37th Annual Symposium on Foundations of Computer Science - Burlington, VT, USA Duration: 14 Oct 1996 → 16 Oct 1996

Cite this

@article{aa645c446c384046aedd229ae29e2ad0,

title = "Median selection requires (2+ε)n comparisons",

abstract = "Improving a long standing result of Bent and John, we obtain a (2+ε)n lower bound (for some fixed ε>0) on the number of comparisons required, in the worst case, for selecting the median of n elements. The new lower bound is obtained using a weight function that allows us to combine leaf counting and adversary arguments.",

author = "Dorit Dor and Uri Zwick",

year = "1996",

language = "אנגלית",

pages = "125--134",

journal = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

issn = "0272-5428",

note = "Proceedings of the 1996 37th Annual Symposium on Foundations of Computer Science ; Conference date: 14-10-1996 Through 16-10-1996",

}

TY - JOUR

T1 - Median selection requires (2+ε)n comparisons

AU - Dor, Dorit

AU - Zwick, Uri

PY - 1996

Y1 - 1996

N2 - Improving a long standing result of Bent and John, we obtain a (2+ε)n lower bound (for some fixed ε>0) on the number of comparisons required, in the worst case, for selecting the median of n elements. The new lower bound is obtained using a weight function that allows us to combine leaf counting and adversary arguments.

AB - Improving a long standing result of Bent and John, we obtain a (2+ε)n lower bound (for some fixed ε>0) on the number of comparisons required, in the worst case, for selecting the median of n elements. The new lower bound is obtained using a weight function that allows us to combine leaf counting and adversary arguments.

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

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0030415659

SN - 0272-5428

SP - 125

EP - 134

JO - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

JF - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

T2 - Proceedings of the 1996 37th Annual Symposium on Foundations of Computer Science

Y2 - 14 October 1996 through 16 October 1996

ER -

Median selection requires (2+ε)n comparisons

Abstract

Other files and links

Fingerprint

Cite this