Selecting the k largest elements with parity tests

被引：4
|
作者：
Lam, TW [1 ]
Ting, HF [1 ]
机构：
[1] Univ Hong Kong, Dept Comp Sci & Informat Syst, Hong Kong, Hong Kong, Peoples R China
来源：
DISCRETE APPLIED MATHEMATICS | 2000年 / 101卷 / 1-3期
关键词：
selection; lower bound; randomized algorithm; parity tests;
D O I：
10.1016/S0166-218X(99)00193-6
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper we study the problem of finding the k largest elements of n distinct real numbers. We give a pure combinatorial argument to prove that n + (k - 1)log n + O(1) queries are necessary for any deterministic algorithm using parity tests only. We also present a randomized algorithm with error probability O(1/n(c)) using only O(log(2) n + k log n) parity tests, where c > 1 is any fixed constant. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：187 / 196
页数：10
相关论文
共 50 条
12345