2022
DOI: 10.1007/s10559-022-00431-8
|View full text |Cite
|
Sign up to set email alerts
|

Peculiarities of the Parallel Sorting Algorithm with Rank Formation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…In addition, many scholars have conducted in-depth research on sorting optimization algorithms: Martyniuk and Krukivskyi [8] analyzed a new method to sort a set of numbers in parallel. In the sorting process, a decrement operation that handled numeric array elements: traversing the array was performed, decrementing each element individually [8]. Wang et al [9] proposed a new sorting algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…In addition, many scholars have conducted in-depth research on sorting optimization algorithms: Martyniuk and Krukivskyi [8] analyzed a new method to sort a set of numbers in parallel. In the sorting process, a decrement operation that handled numeric array elements: traversing the array was performed, decrementing each element individually [8]. Wang et al [9] proposed a new sorting algorithm.…”
Section: Introductionmentioning
confidence: 99%