Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,983,305 papers from all fields of science
Search
Sign In
Create Free Account
Bitonic sorter
Known as:
Bitonic mergesort
, Bitonic sort
, Sorter
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Array data structure
Batcher odd–even mergesort
Integer sorting
Java
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
High-dimensional quantum cryptography with twisted light
M. Mirhosseini
,
O. Magaña-Loaiza
,
+6 authors
R. Boyd
2014
Corpus ID: 5300819
Quantum key distribution (QKD) systems often rely on polarization of light for encoding, thus limiting the amount of information…
Expand
Highly Cited
2013
Highly Cited
2013
LLR-Based Successive Cancellation List Decoding of Polar Codes
Alexios Balatsoukas-Stimming
,
Mani Bastani Parizi
,
A. Burg
IEEE Transactions on Signal Processing
2013
Corpus ID: 1120491
We show that successive cancellation list decoding can be formulated exclusively using log-likelihood ratios. In addition to…
Expand
Highly Cited
2011
Highly Cited
2011
FPGASort: a high performance sorting architecture exploiting run-time reconfiguration on fpgas for large problem sorting
Dirk Koch
,
J. Tørresen
Symposium on Field Programmable Gate Arrays
2011
Corpus ID: 14854186
This paper analyses different hardware sorting architectures in order to implement a highly scaleable sorter for solving huge…
Expand
Highly Cited
2006
Highly Cited
2006
Dielectrophoretic manipulation of drops for high-speed microfluidic sorting devices
K. Ahn
,
C. Kerbage
,
T. Hunt
,
R. Westervelt
,
D. Link
,
D. Weitz
2006
Corpus ID: 120099805
We demonstrate a high-throughput drop sorter for microfluidic devices that uses dielectrophoretic forces. Microelectrodes…
Expand
Review
2006
Review
2006
All work and no play: Measuring fun, usability, and learning in software for children
G. Sim
,
S. MacFarlane
,
J. Read
Comput. Educ.
2006
Corpus ID: 13099508
Highly Cited
2004
Highly Cited
2004
Parataxonomy vs. taxonomy in biodiversity studies – pitfalls and applicability of ‘morphospecies’ sorting
F. Krell
Biodiversity and Conservation
2004
Corpus ID: 8292963
Parataxonomic sorting of samples to recognizable taxonomic units (RTUs, morphospecies, morphotypes or, as proposed here…
Expand
Highly Cited
2004
Highly Cited
2004
Reduction of Aflatoxin and Fumonisin Contamination in Yellow Corn by High‐Speed Dual‐Wavelength Sorting
T. Pearson
,
D. Wicklow
,
M. C. Pasikatan
2004
Corpus ID: 42904890
ABSTRACT A high-speed dual-wavelength sorter was tested for removing corn contaminated in the field with aflatoxin and fumonisin…
Expand
Highly Cited
2000
Highly Cited
2000
Minimizing Communication in the Bitonic Sort
Jae-dong Lee
,
K. Batcher
IEEE Trans. Parallel Distributed Syst.
2000
Corpus ID: 5356109
This paper presents bitonic sorting schemes for special-purpose parallel architectures such as sorting networks and for general…
Expand
Highly Cited
1994
Highly Cited
1994
Experience with a learning personal assistant
Tom Michael Mitchell
,
R. Caruana
,
Dayne Freitag
,
J. McDermott
,
David Zabowski
CACM
1994
Corpus ID: 8528878
Personal software assistants that help users with tasks like finding information, scheduling calendars, or managing work-flow…
Expand
Highly Cited
1979
Highly Cited
1979
Bitonic Sort on a Mesh-Connected Parallel Computer
David Nassimi
,
S. Sahni
IEEE transactions on computers
1979
Corpus ID: 36035966
An O(n) algorithm to sort n2elements on an Illiac IV-like n × n mesh-connected processor array is presented. This algorithm sorts…
Expand
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)
ACCEPT & CONTINUE
or Only Accept Required