Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,715,834 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.
2015
2015
Dynamic algorithms for partially-sorted lists
Kostya Ross
2015
Corpus ID: 55971869
The dynamic partial sorting problem asks for an algorithm that maintains lists of numbers under the link, cut and change value…
Expand
2014
2014
FlowSort parameters elicitation : the case of partial sorting CoDE-SMG – Technical Report Series
Van Assche
,
De Smet
2014
Corpus ID: 11241577
We consider the context of partial sorting. We address the problem of finding the parameters of the FlowSort method using an…
Expand
2014
2014
Dynamic Partial Sorting
J. Liu
,
Kostya Ross
arXiv.org
2014
Corpus ID: 135355
The dynamic partial sorting problem asks for an algorithm that maintains lists of numbers under the link, cut and change value…
Expand
2014
2014
Multireduce and Multiscan on Modern GPUs
Marco Eilers
2014
Corpus ID: 64849211
With the introduction of platforms like CUDA and OpenCL, the superior computing power of modern GPUs compared to CPUs is used…
Expand
2013
2013
BetaSAC et OABSAC, deux nouveaux 'echantillonnages conditionnels pour RANSAC
Antoine Méler
2013
Corpus ID: 45750776
L'algorithme RANSAC (Random Sample Consensus) est l'approche la plus populaire pour l'estimation robuste des parametres d'un…
Expand
2011
2011
A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks
J. Myoupo
,
Aboubecrine Ould Cheikhna
2011
Corpus ID: 11052972
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
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
2005
2005
Forty Years of 'Quicksort' and 'Quickselect': a Personal View
Marianne Durand
2005
Corpus ID: 16442335
The algorithms ‘quicksort’ [3] and ‘quickselect’ [2], invented by Hoare, are simple and elegant solutions to two basic problems…
Expand
1976
1976
Theoretical bounds on the complexity of inexact computations
J. Pearl
IEEE Transactions on Information Theory
1976
Corpus ID: 1066324
This paper considers the reduction in algorithmic complexity that can be achieved by permitting approximate answers to…
Expand
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