"An O(n log n) Cost Parallel Algorithm for the Single Function Coarsest" by A. Apostolico, C. S. Iliopoulos et al.

Skip to main content

Department of Computer Science Technical Reports

Title

An O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem

Authors

A. Apostolico
C. S. Iliopoulos
Robert Paige

Date of this Version

1986

Tech Report Number

86-640

Number of Pages

14

Included in

Computer Sciences Commons

COinS