Randomized selection in n + C + o(n) comparisons

Alexandros V. Gerbessiotis; Constantinos J. Siniolakis

doi:10.1016/S0020-0190(03)00361-2

Randomized selection in n + C + o(n) comparisons

Alexandros V. Gerbessiotis, Constantinos J. Siniolakis

Computer Science

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

A study was conducted on a randomized selection algorithms with high probability. The algorithm was used to determine the Cth order of the n keys for matching a corresponding lower bound on the average number of comparisons required. The result showed that the low order terms in the number of comparisons performed was reduced by the extending the algorithms and analyzing its resulting performance.

Original language	English (US)
Pages (from-to)	95-100
Number of pages	6
Journal	Information Processing Letters
Volume	88
Issue number	3
DOIs	https://doi.org/10.1016/S0020-0190(03)00361-2
State	Published - Nov 15 2003

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Keywords

Randomized algorithms
Selection

Access to Document

10.1016/S0020-0190(03)00361-2

Cite this

@article{c154638a7bc248a48b34b8262b8b785f,

title = "Randomized selection in n + C + o(n) comparisons",

abstract = "A study was conducted on a randomized selection algorithms with high probability. The algorithm was used to determine the Cth order of the n keys for matching a corresponding lower bound on the average number of comparisons required. The result showed that the low order terms in the number of comparisons performed was reduced by the extending the algorithms and analyzing its resulting performance.",

keywords = "Randomized algorithms, Selection",

author = "Gerbessiotis, {Alexandros V.} and Siniolakis, {Constantinos J.}",

year = "2003",

month = nov,

day = "15",

doi = "10.1016/S0020-0190(03)00361-2",

language = "English (US)",

volume = "88",

pages = "95--100",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Randomized selection in n + C + o(n) comparisons

AU - Gerbessiotis, Alexandros V.

AU - Siniolakis, Constantinos J.

PY - 2003/11/15

Y1 - 2003/11/15

N2 - A study was conducted on a randomized selection algorithms with high probability. The algorithm was used to determine the Cth order of the n keys for matching a corresponding lower bound on the average number of comparisons required. The result showed that the low order terms in the number of comparisons performed was reduced by the extending the algorithms and analyzing its resulting performance.

AB - A study was conducted on a randomized selection algorithms with high probability. The algorithm was used to determine the Cth order of the n keys for matching a corresponding lower bound on the average number of comparisons required. The result showed that the low order terms in the number of comparisons performed was reduced by the extending the algorithms and analyzing its resulting performance.

KW - Randomized algorithms

KW - Selection

UR - http://www.scopus.com/inward/record.url?scp=0141818934&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0141818934&partnerID=8YFLogxK

U2 - 10.1016/S0020-0190(03)00361-2

DO - 10.1016/S0020-0190(03)00361-2

M3 - Article

AN - SCOPUS:0141818934

SN - 0020-0190

VL - 88

SP - 95

EP - 100

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

Randomized selection in n + C + o(n) comparisons

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this