Odd-Even Merge Sort is a parallel sorting algorithm that belongs to the class of merge-based sorting networks and is distinguished by its recursive decomposition of the sorting problem into odd and even indexed subsequences, which are independently sorted and then merged through a series of compare-exchange operations to produce a fully ordered sequence.
17
Publications
439
Citations
40
Authors
24
Institutions
Publications per year
2017–2026
5
Parents
Publications
17
1–5 of 17
Authors
40
- KE
2
h-index
- HN
2
h-index
- CC
2
h-index
- PG
2
h-index
- NE
2
h-index
1–5 of 40
Institutions
24
Tata Consultancy Services (India)
Pune, India
2 h-index
5 publications
106 citations
Arizona State University
Tempe, United States
2 h-index
3 publications
111 citations
Kent State University
Kent, United States
2 h-index
3 publications
66 citations
Universidad de Málaga
Málaga, Spain
1 h-index
1 publications
24 citations
University of Córdoba
Córdoba, Spain
1 h-index
3 publications
72 citations
University of California, Irvine
Irvine, United States
1 h-index
1 publications
81 citations
Indian Institute of Technology Goa
Ponda, India
1 h-index
2 publications
64 citations
Rice University
Houston, United States
1 h-index
1 publications
81 citations
1–8 of 24
Venues
- IEEE Transactions on Circuits and Systems I Regular Papers
2 publications · 33 citations
2
h-index
- 2020 International Conference on Electronics and Sustainable Communication Systems (ICESC)
Conference · 1 publications · 32 citations
1
h-index
- IEEE Transactions on Very Large Scale Integration (VLSI) Systems
1 publications · 28 citations
1
h-index
- Constraints
1 publications · 16 citations
1
h-index
- IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing
1 publications · 55 citations
1
h-index
1–5