@inproceedings{b98f5e111373404dacc7986bc2ce9f32,
title = "Selecting the median",
abstract = "Improving a long standing result of Sch{\"o}nhage, Paterson and Pippenger we show that the median of a set containing n elements can be found using at most 2.95n comparisons.",
author = "Dorit Dor and Uri Zwick",
year = "1995",
month = jan,
day = "22",
language = "אנגלית",
series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "Association for Computing Machinery",
pages = "28--37",
booktitle = "Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995",
note = "6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995 ; Conference date: 22-01-1995 Through 24-01-1995",
}