Login / Signup
On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem.
Alberto Apostolico
Costas S. Iliopoulos
Robert Paige
Published in:
Parallel Algorithms and Architectures (1987)
Keyphrases
</>
parallel algorithm
multiresolution
cluster of workstations
shared memory
parallel computation
medial axis transform
parallel programming
binary search trees
worst case
parallel computers
parallel implementations
lower bound
gray scale
orders of magnitude
graphics processors