AbstractThe problem of minimum-comparison-merging is solved for the case of one 4-element and one arbitrary finite chain. For the case of one 5-element chain very tight bounds are presented which can be used to beat Ford-Johnson-sorting for infinitely many intervals of arguments, starting with n = 47
AbstractWe consider the problem of merging m disjoint ordered lists, each of size n⧸/m. We determine...
Given an array with n elements, we want to rearrange them in ascending order. Sorting algorithms suc...
AbstractWe present an algorithm for asymptotically efficient k-way merging. Given an array A contain...
AbstractThe problem of minimum-comparison-merging is solved for the case of one 4-element and one ar...
The problem of merging ordered sets in the least number of binary comparisons has been solved comple...
Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their...
In this paper we show how to stably merge two sequences A and B of sizes m and n, m n, respectivel...
The problem of merging ordered sets in the least number of binary comparisons has been solved comple...
In the comparison model the only operations allowed on input elements are comparisons and moves to e...
We investigate the worst case complexity regarding the number of comparisons for a simple and stable...
[[abstract]]In this paper, we shall show the lower bound of the number of k-sorters needed for a non...
We consider the problem of sorting n elements in the case of persistent comparison errors. In this p...
This paper describes a computer-assisted non-existence proof of 9-input sorting networks consisting ...
We present the first in-place algorithm for sorting an array of size n that performs, in the worst c...
AbstractA lower bound theorem is established for the number of comparators in a merging network. Let...
AbstractWe consider the problem of merging m disjoint ordered lists, each of size n⧸/m. We determine...
Given an array with n elements, we want to rearrange them in ascending order. Sorting algorithms suc...
AbstractWe present an algorithm for asymptotically efficient k-way merging. Given an array A contain...
AbstractThe problem of minimum-comparison-merging is solved for the case of one 4-element and one ar...
The problem of merging ordered sets in the least number of binary comparisons has been solved comple...
Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their...
In this paper we show how to stably merge two sequences A and B of sizes m and n, m n, respectivel...
The problem of merging ordered sets in the least number of binary comparisons has been solved comple...
In the comparison model the only operations allowed on input elements are comparisons and moves to e...
We investigate the worst case complexity regarding the number of comparisons for a simple and stable...
[[abstract]]In this paper, we shall show the lower bound of the number of k-sorters needed for a non...
We consider the problem of sorting n elements in the case of persistent comparison errors. In this p...
This paper describes a computer-assisted non-existence proof of 9-input sorting networks consisting ...
We present the first in-place algorithm for sorting an array of size n that performs, in the worst c...
AbstractA lower bound theorem is established for the number of comparators in a merging network. Let...
AbstractWe consider the problem of merging m disjoint ordered lists, each of size n⧸/m. We determine...
Given an array with n elements, we want to rearrange them in ascending order. Sorting algorithms suc...
AbstractWe present an algorithm for asymptotically efficient k-way merging. Given an array A contain...
DOI
Add to ORKG