Sorting algorithm

Known as: Sorting Algorithms, Sorted list, Stable sort 
A sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
We describe the design of high-performance parallel radix sort and merge sort routines for manycore GPUs, taking advantage of the… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We present a novel external sorting algorithm using graphics processors (GPUs) on large databases composed of billions of records… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This thesis presents efficient algorithms for internal and external parallel sorting and remote data update. The sorting… (More)
  • figure 1.1
  • figure 1.5
  • figure 1.6
  • figure 1.7
  • figure 1.8
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Quicksort is the preferred in-place sorting algorithm in many contexts, since its average computing time on uniformly distributed… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
In trying to solve multiobjective optimization problems, many traditional methods scalarize the objective vector into a single… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The charter of SRC is to advance both the state of knowledge and the state of the art in computer systems. From our establishment… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We provide tight upper and lower bounds, up to a constant factor, for the number of inputs and outputs (I/OS) between internal… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1986
Highly Cited
1986
In this paper we prove a 3n upper and lower bound on the complexity of sorting on a n × n mesh connected parallel computer, and… (More)
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
1985
Highly Cited
1985
The concept of presortedness and its use in sorting are studied. Natural ways to measure presortedness are given and some general… (More)
Is this relevant?