Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,979,039 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Average-case complexity
C++
Communications of the ACM
Computer science
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Instant restore after a media failure (extended version)
Caetano Sauer
,
T. Härder
,
G. Graefe
Information Systems
2019
Corpus ID: 69736491
2017
2017
Instant Restore After a Media Failure
Caetano Sauer
,
G. Graefe
,
T. Härder
Symposium on Advances in Databases and…
2017
Corpus ID: 16330661
Media failures usually leave database systems unavailable for several hours until recovery is complete, especially in…
Expand
2017
2017
Chemical enrichment of the planet-forming region as probed by accretion
R. Booth
,
C. Clarke
2017
Corpus ID: 55658593
This work has been supported by the DISCSIM project, grant agreement 341137 funded by the European Research Council under ERC…
Expand
2015
2015
Classifying distributions via symbolic entropy estimation
U. Speidel
International Conference on Information…
2015
Corpus ID: 8376614
Shannon observed that the normal distribution has maximal entropy among distributions with a density function and a given…
Expand
2012
2012
Multi‐GPU algorithm for k‐nearest neighbor problem
Kimikazu Kato
,
Tikara Hosino
Concurrency and Computation
2012
Corpus ID: 44457886
The recommendation system is a mechanism which automatically recommends items that are likely to be of interest to the user. In…
Expand
2008
2008
A linear-time nearest point algorithm for the lattice An*
R. McKilliam
,
I. Vaughan L. Clarkson
,
W. D. Smith
,
Barry G. Quinn
International Symposium on Information Theory and…
2008
Corpus ID: 17211402
The lattice An* is an important lattice because of its covering properties in low dimensions. Two algorithms exist in the…
Expand
2007
2007
Pictures from Mongolia - Partial Sorting in a Partial World
P. Boldi
,
Flavio Chierichetti
,
S. Vigna
Fun with Algorithms
2007
Corpus ID: 20374239
You are back from that very long, marvelous journey. You have a thousand pictures, but your friends and relatives will stand just…
Expand
Review
2007
Review
2007
Under review for IEEE Transactions on Parallel and Distributed Systems Parallel Construction of Multidimensional Binary Search Trees
Ibraheem Al-Furaih
,
S. Aluru
,
Sanjay Goil
,
S. Ranka
2007
Corpus ID: 3123558
Multidimensional binary search tree (abbreviated k-d tree) is a popular data structure for the organization and manipulation of…
Expand
2006
2006
Chunksort: a generalized partial sorting algorithm
Conrado Martínez
2006
Corpus ID: 11871643
. We introduce here the problem of generalized partial sorting and chunksort , an algorithm closely related to quicksort and…
Expand
1982
1982
Construction of the two-electron interaction matrix fron a P supermatrix file: An improved algorithm
M. Bénard
,
B. Speckel
Computers and Chemistry
1982
Corpus ID: 5910209
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE