248 search results - page 2 / 50 » A Simple Optimal Randomized Algorithm for Sorting on the PDM |
PODS
2001
ACM
14 years 5 months ago
2001
ACM
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
STOC
1990
ACM
13 years 9 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
ICPP
1995
IEEE
13 years 9 months ago
1995
IEEE
In this paper we study the problems of sorting and selection on the Distributed Memory Bus Computer (DMBC) recently introduced by Sahni. In particular we present: 1) An efficient a...
IPPS
1997
IEEE
13 years 10 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...
IPPS
1997
IEEE
13 years 10 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...