Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Media failures usually leave database systems unavailable for several hours until recovery is complete, especially in… 
2017
2017
In this paper we introduce the Indexed Massive Directory, a new technique for indexing data within DeltaFS. With its design as a… 
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… 
Highly Cited
2013
Highly Cited
2013
High-throughput and low-latency sorting is a key requirement in many applications that deal with large amounts of data. This… 
2011
2011
Online index functionality allows concurrent queries and updates during index maintenance tasks, e.g., creation of a new… 
2008
2008
The lattice An* is an important lattice because of its covering properties in low dimensions. Two algorithms exist in the… 
2007
2007
You are back from that very long, marvelous journey. You have a thousand pictures, but your friends and relatives will stand just… 
2006
2006
We introduce here the problem of generalized partial sorting and chunksort, an algorithm closely related to quicksort and… 
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…