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
Parents
99
Inter-block GPU communication via fast barrier synchronization
Shucai Xiao, Wu-chun Feng · 2010 · 277 citations · Full text
Bitonic Sort on a Mesh-Connected Parallel Computer
Nassimi, Sahni · IEEE Transactions on Computers · 1979 · 255 citations
Daniel Cederman, Philippas Tsigas · ACM Journal of Experimental Algorithmics · 2009 · 108 citations
1–5 of 99
259
5
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 259
106
Kent State University
Kent, United States
4 h-index
6 publications
139 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
4 h-index
6 publications
412 citations
University of Southern California
Los Angeles, United States
4 h-index
10 publications
387 citations

University of Minnesota
Minneapolis, United States
3 h-index
10 publications
874 citations
The University of Texas at Austin
Austin, United States
3 h-index
6 publications
176 citations
Purdue University West Lafayette
West Lafayette, United States
3 h-index
3 publications
93 citations
Politecnico di Torino
Turin, Italy
3 h-index
7 publications
100 citations
Korea University
Seoul, South Korea
2 h-index
5 publications
90 citations
1–8 of 106
9 publications · 487 citations
9
h-index
TPDS · 4 publications · 111 citations
4
h-index
4 publications · 100 citations
4
h-index
3 publications · 78 citations
3
h-index
2 publications · 30 citations
2
h-index
1–5