File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/S0166-218X(99)00193-6
- Scopus: eid_2-s2.0-0347304330
- WOS: WOS:000085777500012
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Selecting the k largest elements with parity tests
Title | Selecting the k largest elements with parity tests |
---|---|
Authors | |
Keywords | Lower Bound Parity Tests Randomized Algorithm Selection |
Issue Date | 2000 |
Publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/dam |
Citation | Discrete Applied Mathematics, 2000, v. 101 n. 1-3, p. 187-196 How to Cite? |
Abstract | 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)logn+O(1) queries are necessary for any deterministic algorithm using parity tests only. We also present a randomized algorithm with error probability O(1/nc) using only O(log2n+klogn) parity tests, where c>1 is any fixed constant. © 2000 Elsevier Science B.V. |
Persistent Identifier | http://hdl.handle.net/10722/152310 |
ISSN | 2023 Impact Factor: 1.0 2023 SCImago Journal Rankings: 0.657 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lam, TW | en_US |
dc.contributor.author | Ting, HF | en_US |
dc.date.accessioned | 2012-06-26T06:37:05Z | - |
dc.date.available | 2012-06-26T06:37:05Z | - |
dc.date.issued | 2000 | en_US |
dc.identifier.citation | Discrete Applied Mathematics, 2000, v. 101 n. 1-3, p. 187-196 | en_US |
dc.identifier.issn | 0166-218X | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/152310 | - |
dc.description.abstract | 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)logn+O(1) queries are necessary for any deterministic algorithm using parity tests only. We also present a randomized algorithm with error probability O(1/nc) using only O(log2n+klogn) parity tests, where c>1 is any fixed constant. © 2000 Elsevier Science B.V. | en_US |
dc.language | eng | en_US |
dc.publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/dam | en_US |
dc.relation.ispartof | Discrete Applied Mathematics | en_US |
dc.subject | Lower Bound | en_US |
dc.subject | Parity Tests | en_US |
dc.subject | Randomized Algorithm | en_US |
dc.subject | Selection | en_US |
dc.title | Selecting the k largest elements with parity tests | en_US |
dc.type | Article | en_US |
dc.identifier.email | Lam, TW:twlam@cs.hku.hk | en_US |
dc.identifier.email | Ting, HF:hfting@cs.hku.hk | en_US |
dc.identifier.authority | Lam, TW=rp00135 | en_US |
dc.identifier.authority | Ting, HF=rp00177 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1016/S0166-218X(99)00193-6 | - |
dc.identifier.scopus | eid_2-s2.0-0347304330 | en_US |
dc.identifier.hkuros | 51953 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0347304330&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 101 | en_US |
dc.identifier.issue | 1-3 | en_US |
dc.identifier.spage | 187 | en_US |
dc.identifier.epage | 196 | en_US |
dc.identifier.isi | WOS:000085777500012 | - |
dc.publisher.place | Netherlands | en_US |
dc.identifier.scopusauthorid | Lam, TW=7202523165 | en_US |
dc.identifier.scopusauthorid | Ting, HF=7005654198 | en_US |
dc.identifier.issnl | 0166-218X | - |