4315 search results - page 3 / 863 » Sorting in linear time |
137
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
170
click to vote
IPPS
2006
IEEE
16 years 7 days ago
2006
IEEE
In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p strea...
167
click to vote
ALENEX
2007
15 years 7 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
181
click to vote
STRINGOLOGY
2004
15 years 7 months ago
2004
Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial di...
152
click to vote
IWOCA
2009
Springer
16 years 23 days ago
2009
Springer
A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average of the leaves’ depths, it minimizes the maximum of any leaf’s weight plus i...