Skip to search formSkip to main contentSkip to account menu

Bitonic sorter

Known as: Bitonic mergesort, Bitonic sort, Sorter 
Bitonic mergesort is a parallel algorithm for sorting. It is also used as a construction method for building a sorting network. The algorithm was… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
We demonstrate few-photon-level infrared imaging at 1040  nm by coincidence frequency upconversion with a high conversion… 
2006
2006
Grains highly contaminated by aflatoxin and fumonisin are unevenly distributed in a grain lot and may be concentrated in a very… 
2004
2004
This paper presents the hardware realization of a recurrent scalable sorting network based on Batcher’s bitonic algorithm, which… 
2002
2002
We present a novel bit serial algorithm which is scalable and easily implemented on small FPGA chips. The basis of the algorithm… 
2000
2000
Sorting long sequences of keys is a problem that occurs in many different applications. For embedded systems, a uniprocessor… 
1999
1999
Human folate receptor α (FRα) is a folate-binding protein that is selectively overexpressed in ovarian carcinoma and has been… 
1990
1990
We propose new deadlock-free routing and broadcasting algorithms for incomplete hypercube network that have optimal communication… 
1983
1983
A hardware sorter suitable for VLSI implementation is proposed. It operates in a parallel and pipelined fashion, with the actual… 
Highly Cited
1981
Highly Cited
1981
Two generic record-permutation bubble devices—the bubble ladder and the bubble string comparator—have been reported in the… 
Highly Cited
1978
Highly Cited
1978
Sorting plays an increasingly important role in determining the overall performance of data base systems. Described is a new…