Selecting the \(k\) largest elements with parity tests
type: Item
instance of: scholarly article
title: Selecting the \(k\) largest elements with parity tests
zbMATH Open document ID: 0953.68149
DOI: 10.1016/S0166-218X(99)00193-6
author: Hing-Fung Ting
author: Tak-Wah Lam
published in: Discrete Applied Mathematics
publication date: 2000-04-09T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1428623
zbMATH Keywords: selection
zbMATH Keywords: lower bound
zbMATH Keywords: randomized algorithm
zbMATH Keywords: parity tests
MaRDI profile type: Publication
Wikidata QID: Q58063071
cites work: Decision trees
cites work: A Counting Approach to Lower Bounds for Selection Problems
cites work: On selecting the \(k\) largest with restricted quadratic queries
cites work: Bounds for Selection
cites work: A Unified Lower Bound for Selection and Set Partitioning Problems
cites work: Q5601827
cites work: A randomized algorithm for finding maximum with \(O((\log n)^2)\) polynomial tests
cites work: On selecting the k largest with median tests
full work available at URL: s0166-218x(99)00193-6
OpenAlex ID: W2034302955
DBLP publication ID: journals/dam/LamT00
description: scientific article; zbMATH DE number 1428623