1623 search results - page 13 / 325 » No Sorting |
75
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
101
Voted
AMC
2007
15 years 27 days ago
2007
: The present paper makes use of factorial experiments to assess software complexity using insertion sort as a trivial example. We next propose to implement the methodology in quic...
71
Voted
CORR
2007
Springer
15 years 22 days ago
2007
Springer
A generalization of the heapsort algorithm is proposed. At the expense of about 50% more comparison and move operations for typical cases, the dualheap sort algorithm offers sever...
80
Voted
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
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 ...
96
Voted
RECOMB
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...