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.
Highly Cited
2014
Highly Cited
2014
Quantum key distribution (QKD) systems often rely on polarization of light for encoding, thus limiting the amount of information… 
Highly Cited
2013
Highly Cited
2013
We show that successive cancellation list decoding can be formulated exclusively using log-likelihood ratios. In addition to… 
Highly Cited
2011
Highly Cited
2011
This paper analyses different hardware sorting architectures in order to implement a highly scaleable sorter for solving huge… 
Highly Cited
2006
Highly Cited
2006
We demonstrate a high-throughput drop sorter for microfluidic devices that uses dielectrophoretic forces. Microelectrodes… 
Highly Cited
2004
Highly Cited
2004
Parataxonomic sorting of samples to recognizable taxonomic units (RTUs, morphospecies, morphotypes or, as proposed here… 
Highly Cited
2004
Highly Cited
2004
ABSTRACT A high-speed dual-wavelength sorter was tested for removing corn contaminated in the field with aflatoxin and fumonisin… 
Highly Cited
2000
Highly Cited
2000
This paper presents bitonic sorting schemes for special-purpose parallel architectures such as sorting networks and for general… 
Highly Cited
1994
Highly Cited
1994
Personal software assistants that help users with tasks like finding information, scheduling calendars, or managing work-flow… 
Highly Cited
1979
Highly Cited
1979
An O(n) algorithm to sort n2elements on an Illiac IV-like n × n mesh-connected processor array is presented. This algorithm sorts…