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)

Related topics

Related topics

13 relations
Array data structureBatcher odd–even mergesortInteger sortingJava

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2011
Review
2011
Usage of Fruit Response to Both Force and Forced Vibration Applied to Assess Fruit Firmness-a Review
Nowadays consumers are more cautious about quality of their foods. The attempts to assess the quality of food materials are… 
2007
2007
Simulating the Bitonic Sort Using P Systems
This paper gives a version of the parallel bitonic sorting algorithm of Batcher, which can sort N elements in time O(log2 N). We… 
2004
2004
A Reconfigurable Recurrent Bitonic Sorting Network for Concurrently Accessible Data
This paper presents the hardware realization of a recurrent scalable sorting network based on Batcher’s bitonic algorithm, which… 
Highly Cited
2003
Highly Cited
2003
Using the hidden isotopic heterogeneity in phyto‐ and zooplankton to unmask disparity in trophic carbon transfer
In this study, we show that natural phototrophic populations can be probed individually for their in situ δ13C signature by… 
Highly Cited
2003
Highly Cited
2003
Tannic Acid Is an Inhibitor of CXCL12 (SDF-1α)/CXCR4 with Antiangiogenic Activity
The Basic Research Program, Science Applications International Corporation-Frederick, Inc. (X. C., T. G. M., H-F. D., O. Y. C… 
2001
2001
Communication-efficient bitonic sort on a distributed memory parallel computer
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Bitonic sorting can be… 
Highly Cited
2000
Highly Cited
2000
Minimizing Communication in the Bitonic Sort
This paper presents bitonic sorting schemes for special-purpose parallel architectures such as sorting networks and for general… 
1989
1989
A bitonic-sorter based VLSI implementation of the M-algorithm
  • S. Simmons
  • Conference Proceeding IEEE Pacific Rim Conference…
  • 1989
  • Corpus ID: 18368869
An implementation of the M-algorithm based on a bitonic sorter is proposed for VLSI implementation. The sorting network is… 
1986
1986
A Real Time Digital Coincidence Processor for Positron Emission Tomography
A Real Time Digital Coincidence Processor has been developed for use in the Positron Emission Tomograph (PET) ECAT® scanners… 
1979
1979
Isolation of twelve monoclonal antibodies against Ia and H-2 antigens. Serological characterization and reactivity with B and T lymphocytes
The cell hybridization technique was used for the production of 12 monoclonal antibodies against H-2Kk, H-2Db, I-Ak and I-Ek… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)