Name
Title | ||
|---|---|---|
On O(n log n) cost parallel algorithm for the single function coarsest partition problem |
Abstract | ||
|---|---|---|
A CRCW PRAM algorithm is presented for computing the coarsest refinement of a partition of a finite set S of n elements with respect to a function f on S. The algorithm requires O(n) processors, O(logn) time, and and O(nlogn) space in the worst case. |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1007/3-540-18099-0_30 | Parallel Algorithms and Architectures |
Keywords | Field | DocType |
parallel algorithm,single function coarsest partition,n log n,cost parallel algorithm | Partition problem,Combinatorics,Mathematical optimization,Finite set,Parallel algorithm,Initial segment,Time complexity,Partition (number theory),Mathematics | Conference |
ISBN | Citations | PageRank |
0-387-18099-0 | 1 | 0.40 |
References | Authors | |
7 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A Apostolico | 1 | 338 | 48.71 |
| C. S. Iliopoulos | 2 | 52 | 6.67 |
| R. Paige | 3 | 1 | 0.40 |