1623 search results - page 18 / 325 » No Sorting |
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
101
click to vote
SODA
1994
ACM
15 years 2 months ago
1994
ACM
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
111
Voted
DAM
2010
14 years 11 months ago
2010
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
81
Voted
SWAT
2000
Springer
15 years 4 months ago
2000
Springer
We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory mode...