DOIAbstract
AbstractA simplified form of a sorting machine devised by Armstrong and Rem is defined in this note, and it is shown that it sorts every input sequence
AbstractA simplified form of a sorting machine devised by Armstrong and Rem is defined in this note, and it is shown that it sorts every input sequence
Sorting has long been used to organize data in preparation for further computation, but sort computa...
AbstractThis paper addresses the following question: What is the complexity of sorting n numbers x1,...
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n t...
AbstractA simplified form of a sorting machine devised by Armstrong and Rem is defined in this note,...
AbstractAs a preparation to the study of a particular sorting machine, the sorting of arrays by sequ...
AbstractIf π is a permutation of {1,…,n}, then the effect of the swap Sij on π is that the ith and f...
As a preparation to the study of a particular sorting machine, the sorting of arrays by sequences of...
A miniswap Si,1 ≤ i \u3c n, compares two adjacent keys Пi, Пi+1 in the sequence (П1, ... , Пn), and ...
AbstractThe problem of sorting a sequence of numbers is considered from the perpective of mathematic...
AbstractWe show that a unit-cost RAM with a word length ofwbits can sortnintegers in the range 0…2w−...
In the comparison model the only operations allowed on input elements are comparisons and moves to e...
• We will now undertake a more formal study of algorithms for the sorting problem. • This problem is...
AbstractAn algorithm is described which sorts n numbers in place with the property of stability, i.e...
We show that a unit-cost RAM with a word length of $w$ bits can sort $n$ integers in the range $0\Tt...
Internal sorting methods are possible when all of the items to be accessed fit in a computer\u27s hi...
Sorting has long been used to organize data in preparation for further computation, but sort computa...
AbstractThis paper addresses the following question: What is the complexity of sorting n numbers x1,...
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n t...
AbstractA simplified form of a sorting machine devised by Armstrong and Rem is defined in this note,...
AbstractAs a preparation to the study of a particular sorting machine, the sorting of arrays by sequ...
AbstractIf π is a permutation of {1,…,n}, then the effect of the swap Sij on π is that the ith and f...
As a preparation to the study of a particular sorting machine, the sorting of arrays by sequences of...
A miniswap Si,1 ≤ i \u3c n, compares two adjacent keys Пi, Пi+1 in the sequence (П1, ... , Пn), and ...
AbstractThe problem of sorting a sequence of numbers is considered from the perpective of mathematic...
AbstractWe show that a unit-cost RAM with a word length ofwbits can sortnintegers in the range 0…2w−...
In the comparison model the only operations allowed on input elements are comparisons and moves to e...
• We will now undertake a more formal study of algorithms for the sorting problem. • This problem is...
AbstractAn algorithm is described which sorts n numbers in place with the property of stability, i.e...
We show that a unit-cost RAM with a word length of $w$ bits can sort $n$ integers in the range $0\Tt...
Internal sorting methods are possible when all of the items to be accessed fit in a computer\u27s hi...
Sorting has long been used to organize data in preparation for further computation, but sort computa...
AbstractThis paper addresses the following question: What is the complexity of sorting n numbers x1,...
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n t...
Add to ORKG