Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Parallel sorting networks are widely employed in hardware implementations for sorting due to their high data parallelism and low… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 4
Is this relevant?
Highly Cited
2015
Highly Cited
2015
Quantum key distribution (QKD) systems often rely on polarization of light for encoding, thus limiting the amount of information… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2014
Highly Cited
2014
We present an LLR-based implementation of the successive cancellation list (SCL) decoder. To this end, we associate each decoding… Expand
  • figure 1
  • figure 3
  • figure 4
  • table I
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
This paper analyses different hardware sorting architectures in order to implement a highly scaleable sorter for solving huge… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We demonstrate a high-throughput drop sorter for microfluidic devices that uses dielectrophoretic forces. Microelectrodes… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Parataxonomic sorting of samples to recognizable taxonomic units (RTUs, morphospecies, morphotypes or, as proposed here… Expand
  • table 1
  • table 1
Is this relevant?
2000
2000
This paper presents bitonic sorting schemes for special-purpose parallel architectures such as sorting networks and for general… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Personal software assistants that help users with tasks like finding information, scheduling calendars, or managing work-flow… Expand
  • figure 2-1
  • figure 3-1
  • figure 3-2
  • figure 3-3
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Sorting is arguably the most studied problem in computer science, both because it is used as a substep in many applications and… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • figure 6
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?