![]() | ![]() |
| 1996 | ||
|---|---|---|
| 4 | Clive N. Galley, Costas S. Iliopoulos: A Pram Algorithm for a Special Case of the Set Partition Problem. Parallel Algorithms Appl. 10(1-2): 105-109 (1996) | |
| 3 | Clive N. Galley: AN Omega(log n-k log k) TIME LINEAR COST LOWER BOUND FOR THE k FUNCTIONS COARSEST PARTITION PROBLEM. Parallel Processing Letters 6(2): 195-202 (1996) | |
| 1995 | ||
| 2 | Clive N. Galley: An Omega(log n) time linear cost lower bound for the single function coarsest partition problem. Bulletin of the EATCS 56: (1995) | |
| 1994 | ||
| 1 | Clive N. Galley, Costas S. Iliopoulos: A Simple Parallel Algorithm for the Single Function Coarsest Partition Problem. Parallel Processing Letters 4: 437-445 (1994) | |
| 1 | Costas S. Iliopoulos | [1] [4] |
Data released under the ODC-BY 1.0 license — See also our legal information page