271 search results - page 1 / 55 » Improving the Average Delay of Sorting |
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 ...
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...
ICPP
1992
IEEE
13 years 9 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
ICMCS
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, we propose an accurate analytical model to analyze the performance of initial ranging requests in IEEE 802.16 networks. Two metrics, connection probability and aver...