Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,393,624 papers from all fields of science
Search
Sign In
Create Free Account
Odd–even sort
Known as:
Brick sort
, Odd even sort
, Odd-even sort
In computing, an odd–even sort or odd–even transposition sort (also known as brick sort) is a relatively simple sorting algorithm, developed…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Array data structure
Batcher odd–even mergesort
Bubble sort
Comparison sort
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Design of Hybrid Sorting Unit
V. Harshini
,
K. K. S. Kumar
International Conference on Smart Structures and…
2019
Corpus ID: 204939334
Sorting is the fundamental function of any process for most of the application, The widely used hardware sorting algorithm in…
Expand
2019
2019
Exploiting the Logic-In-Memory paradigm for speeding-up data-intensive algorithms
Mario Cofano
,
M. Vacca
,
G. Santoro
,
G. Causapruno
,
G. Turvani
,
M. Graziano
Integr.
2019
Corpus ID: 88482685
2018
2018
Optimized Concise Implementation of Batcher's Odd-Even Sorting
P. Tarasiuk
,
M. Yatsymirskyy
International Conference on Data Stream Mining…
2018
Corpus ID: 52927259
The odd-even sort algorithm designed by Batcher [1] is a divide-and-conquer parallel sorting algorithm with O(log2(n)) delay time…
Expand
2016
2016
Efficient Sorting Architecture for Successive-Cancellation-List Decoding of Polar Codes
Byeong Yong Kong
,
Hoyoung Yoo
,
I. Park
IEEE Transactions on Circuits and Systems - II…
2016
Corpus ID: 35274124
This brief presents an efficient sorting architecture for successive-cancellation-list decoding of polar codes. In order to avoid…
Expand
2016
2016
An efficient FPGA implementation for odd-even sort based KNN algorithm using OpenCL
Hai Peng
,
Letian Huang
,
John Chen
International SoC Design Conference
2016
Corpus ID: 6938264
Owing to the rising demands for resources integration, a lot of research efforts has been devoted to accelerating the data…
Expand
2015
2015
Low Depth Circuits for Efficient Homomorphic Sorting
Gizem S. Çetin
,
Yarkin Doröz
,
B. Sunar
,
E. Savaş
IACR Cryptology ePrint Archive
2015
Corpus ID: 9553339
We introduce a sorting scheme which is capable of efficiently sorting encrypted data without the secret key. The technique is…
Expand
2015
2015
Depth Optimized Efficient Homomorphic Sorting
Gizem S. Çetin
,
Yarkin Doröz
,
B. Sunar
,
E. Savaş
International Conference on Cryptology and…
2015
Corpus ID: 17887524
We introduce a sorting scheme which is capable of efficiently sorting encrypted data without the secret key. The technique is…
Expand
2012
2012
New Relative Concatenate Sorting algorithm
S. Z. Iqbal
,
M. Ismail
,
H. Gull
International Conference on Computer Science and…
2012
Corpus ID: 18349117
Sorting is technique by which elements are arranged in a particular order following some characteristic or law [1]. In this paper…
Expand
2009
2009
Sorting on a Cell Broadband Engine SPU
S. Bandyopadhyay
,
S. Sahni
IEEE Symposium on Computers and Communications
2009
Corpus ID: 30320
We adapt merge sort for a single SPU of the Cell Broadband Engine. This adaptation takes advantage of the vector instructions…
Expand
1978
1978
Simplified odd-even sort using multiple shift-register loops
T. Chen
,
K. Eswaran
,
V. Lum
,
C. Tung
International Journal of Computing and…
1978
Corpus ID: 12648254
By using anN-loop shift-register structure called a uniform ladder,N records can be sorted by a simplified adaptation of the odd…
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