Sciweavers

19 search results - page 1 / 4
» Sorting and Selection with Imprecise Comparisons
Sort
View
ICALP
2009
Springer
16 years 20 days ago
Sorting and Selection with Imprecise Comparisons
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...
Avinatan Hassidim, Jelani Nelson, Miklós Aj...
IPPS
1998
IEEE
15 years 4 months ago
A Survey of Randomness and Parallelism in Comparison Problems
A survey of results for the problems of selection, mergingand sorting in the Randomized Parallel Comparison Tree RPCT model is given. The results indicate that while randomization ...
Danny Krizanc
ICALP
2009
Springer
16 years 20 days ago
The Number of Symbol Comparisons in QuickSort and QuickSelect
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
Brigitte Vallée, James Allen Fill, Julien C...
100
Voted
SODA
1992
ACM
106views Algorithms» more  SODA 1992»
15 years 1 months ago
Comparison-Sorting and Selecting in Totally Monotone Matrices
An m
Noga Alon, Yossi Azar
JDCTA
2010
92views more  JDCTA 2010»
14 years 7 months ago
Several Incomplete Sort Algorithms for Getting the Median Value
To quickly get the median value of any given sequence is very important in many research fields. Some popular sort algorithms are discussed in this paper. Selection sort algorithm...
Fuguo Dong