Bitonic Sort

Bitonic Sort is a comparison-based parallel sorting algorithm that recursively constructs a bitonic sequence and then decomposes it into sorted subsequences by exploiting a bitonic merge operation, distinguishing it from other parallel sorting methods through its fixed, predeterminable comparison pattern independent of input data.

99

Publications

3.6K

Citations

259

Authors

106

Institutions

Publications per year

2017–2026

21

Authors

259

  1. KE
    Kenneth E. Batcher

    Kent State University, United States

    5 publications · 118 citations

    5

    h-index

  2. HJ
    Howard Jay Siegel

    Colorado State University, United States

    3 publications · 93 citations

    3

    h-index

  3. GB
    Gianfranco Bilardi

    University of Padua, Italy

    3 publications · 178 citations

    3

    h-index

  4. VK
    Viktor K. Prasanna

    University of Southern California, United States

    3 publications · 123 citations

    3

    h-index

  5. PT
    Philippas Tsigas

    Chalmers University of Technology, Sweden

    2 publications · 136 citations

    2

    h-index

1–5 of 259

Venues

  1. IEEE Transactions on Computers

    9 publications · 487 citations

    9

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 4 publications · 111 citations

    4

    h-index

  3. Applied Optics

    4 publications · 100 citations

    4

    h-index

  4. ACM SIGARCH Computer Architecture News

    3 publications · 78 citations

    3

    h-index

  5. 2

    h-index

1–5