A Simple Parallel Algorithm for the Single Function Coarsest Partition Problem. - Clive N. Galley; Costas S. Iliopoulos (Parallel Process. Lett., 1994)

An Omega(log n) time linear cost lower bound for the single function coarsest partition problem. - Clive N. Galley (Bull. EATCS, 1995)

On the lower bound for parallel string matching. - Clive N. Galley; Costas S. Iliopoulos (Int. J. Comput. Math., 1996)

A Pram Algorithm for a Special Case of the Set Partition Problem. - Clive N. Galley; Costas S. Iliopoulos (Parallel Algorithms Appl., 1996)

AN Omega(log n-k log k) TIME LINEAR COST LOWER BOUND FOR THE k FUNCTIONS COARSEST PARTITION PROBLEM. - Clive N. Galley (Parallel Process. Lett., 1996)