21 search results - page 1 / 5 » On the Average Running Time of Odd-Even Merge Sort |
STACS
1995
Springer
13 years 8 months ago
1995
Springer
MST
1998
13 years 5 months ago
1998
We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcherâ...
IPPS
2002
IEEE
13 years 10 months ago
2002
IEEE
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
STACS
1995
Springer
13 years 8 months ago
1995
Springer
Abstract. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then...
TAMC
2007
Springer
13 years 11 months ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...