Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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
Indexing technique has become an efficient tool to enable scientists to directly access the most relevant data records. But, the… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
2017
2017
Media failures usually leave database systems unavailable for several hours until recovery is complete, especially in… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
2016
2016
  • A. Rjabov
  • 15th Biennial Baltic Electronics Conference (BEC)
  • 2016
  • Corpus ID: 10400139
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
2014
2014
Finding the largest clique in a given graph is one of the fundamental NP-hard problems. We take a widely used branch and bound… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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
2008
2008
The lattice An* is an important lattice because of its covering properties in low dimensions. Two algorithms exist in the… Expand
  • table 1
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
Review
2005
Review
2005
Large archives and digital sky surveys with dimensions of bytes currently exist, while in the near future they will reach sizes… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
1996
1996
Multidimensional binary search tree (abbreviated k-d tree) is a popular data structure for the organization and manipulation of… Expand
  • figure 1
1982
1982
Two partial sorting algorithms used in conjunction with Kruskal's algorithm to find minimal spanning trees, are tested. The… Expand