Selecting the median

Dorit Dor, Uri Zwick

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

20 Scopus citations

Abstract

Improving a long standing result of Schönhage, Paterson and Pippenger we show that the median of a set containing n elements can be found using at most 2.95n comparisons.

Original languageEnglish
Title of host publicationProceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995
PublisherAssociation for Computing Machinery
Pages28-37
Number of pages10
ISBN (Electronic)0898713498
StatePublished - 22 Jan 1995
Event6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995 - San Francisco, United States
Duration: 22 Jan 199524 Jan 1995

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995
Country/TerritoryUnited States
CitySan Francisco
Period22/01/9524/01/95

Fingerprint

Dive into the research topics of 'Selecting the median'. Together they form a unique fingerprint.

Cite this