Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

In this paper we generalize the idea of QuickHeapsort leading to the notion of QuickXsort. Given some external sorting algorithm… Expand

Is this relevant?

2002

2002

We present an efficient and practical algorithm for the internal sorting problem. Our algorithm works in-place and, on the… Expand

Is this relevant?

2002

2002

Load balanced parallel radix sort solved the load imbalance problem present in parallel radix sort. By redistributing the keys in… Expand

Is this relevant?

1993

1993

A parallel sorting algorithm is presented for general purpose internal sorting on MIMD machines. The algorithm initially sorts… Expand

Is this relevant?

1987

1987

Seven internal methods for sorting a set (a1, a2,…,an) of real numbers into non-descending order are compared with regard to… Expand

Is this relevant?

1969

1969

An ordering operator that leads to the development of an algorithm for internal sorting is described. An analysis of the… Expand

Is this relevant?

1966

1966

A method is proposed for internal sorting which has the property that the expected time required per record, to sort n records… Expand

Is this relevant?

1963

1963

A general technique for sequencing unsorted records is presented. The technique is shown to be applicable for the first stage of… Expand

Is this relevant?

1961

1961

The purpose of this paper is to describe and discuss the methods available for sorting information within a computer using its… Expand

Is this relevant?

1960

1960

This report concerns the IBM 705, models I and II. It is a study of the machine time required by two internal sorting methods… Expand

Is this relevant?