Skip to search formSkip to main content

Partial sorting

Known as: Partial quicksort, Partial sort, Quickselsort 
In computer science, partial sorting is a relaxed variant of the sorting problem. Total sorting is the problem of returning a list of items such that… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Sorting is one of the most fundamental topics in computer science. Since partial sorting with lower costs would be much more… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2016
2016
  • Artjom Rjabov
  • 15th Biennial Baltic Electronics Conference (BEC)
  • 2016
Fast data sorting is an essential component of many high-performance computing systems. High-throughput and highly parallel… Expand
  • figure 1
  • figure 2
  • table I
  • figure 3
Is this relevant?
2013
2013
High-throughput and low-latency sorting is a key requirement in many applications that deal with large amounts of data. This… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
SUMMARY The recommendation system is a mechanism which automatically recommends items that are likely to be of interest to the… Expand
Is this relevant?
2011
2011
The partial sorting problem is to sort the k smallest elements of a given set of n integers such that 1 <k <n in descending order… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
A recommendation system is a software system to predict customers' unknown preferences from known preferences. In a… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • table I
Is this relevant?
2007
2007
You are back from that very long, marvelous journey. You have a thousand pictures, but your friends and relatives will stand just… Expand
Is this relevant?
2006
2006
We present explicit solutions of a class of recurrences related to the Quickselect algorithm. Thus we are immediately able to… Expand
Is this relevant?
1996
1996
Multidimensional binary search tree (abbreviated k-d tree) is a popular data structure for the organization and manipulation of… Expand
  • figure 1
Is this relevant?
1982
1982
Two partial sorting algorithms used in conjunction with Kruskal's algorithm to find minimal spanning trees, are tested. The… Expand
Is this relevant?