Selection Algorithms

Selection Algorithm is a computational method within the divide and conquer paradigm that identifies the k-th smallest or largest element in an unordered list by recursively partitioning the input space to isolate the desired element with optimal efficiency.

1.2K

Publications

85.9K

Citations

3.5K

Authors

1.3K

Institutions

Publications per year

2017–2026

380

Variants

Selection Algorithm

Authors

3.5K

  1. HL
    Huan Liu

    University of Wollongong, Australia

    9 publications · 4.2K citations

    9

    h-index

  2. IT
    Ioannis Tsamardinos

    University of Crete, Greece

    7 publications · 182 citations

    7

    h-index

  3. SM
    Seyedali Mirjalili

    Torrens University Australia, Australia

    7 publications · 2K citations

    7

    h-index

  4. AP
    A. Paulraj

    Stanford University, United States

    6 publications · 1.8K citations

    6

    h-index

  5. QC
    Quansheng Chen

    Jiangsu University, China

    6 publications · 303 citations

    6

    h-index

1–5 of 3.5K

Venues

  1. IEEE Access

    22 publications · 1.3K citations

    16

    h-index

  2. Expert Systems with Applications

    15 publications · 1.5K citations

    15

    h-index

  3. Bioinformatics

    13 publications · 850 citations

    13

    h-index

  4. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 14 publications · 3.5K citations

    13

    h-index

  5. arXiv (Cornell University)

    Repository · 15 publications · 1K citations

    12

    h-index

1–5