85 search results - page 14 / 17 » On Sorting Permutations by Double-Cut-and-Joins |
73
Voted
APL
1998
ACM
15 years 1 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In this paper we present novel algorithmic solutions for several resource processing and data transfer multicriteria optimization problems. The results of most of the presented tec...
IPL
2006
14 years 9 months ago
2006
We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the framework recently developed by Borodin et al., we consider priority al...
JAL
2002
14 years 9 months ago
2002
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
The main contribution of this work is to present elegant broadcast-efficientalgorithms for permutation routing, ranking, and sorting n items on the Broadcast Communication Model (...