Comparing two Probabilistic Models of the Computational Complexity of the Branch and Bound Algorithm. - Michèle Dion; Marc Gengler; Stéphane Ubéda (CONPAR, 1994)

Parallelizing Compilers: What Can Be Achieved? - Michèle Dion; Yves Robert; Jean-Laurent Philippe (HPCN, 1994)

Mapping affine loop nests: new results. - Michèle Dion; Yves Robert (HPCN Europe, 1995)

Affine Data Mapping with Residual Communication Optimization: Evaluation of Heuristics. - Michèle Dion (HPCN Europe, 1996)

How to Optimize Residual Communications? - Michèle Dion; Cyril Randriamaro; Yves Robert (IPPS, 1996)

Resource-constrained scheduling of partitioned algorithms on processor arrays. - Michèle Dion; Tanguy Risset; Yves Robert (Integr., 1996)

Compiling Affine Nested Loops: How to Optimize the Residual Communications after the Alignment Phase. - Michèle Dion; Cyril Randriamaro; Yves Robert (J. Parallel Distributed Comput., 1996)

Mapping Affine Loop Nests. - Michèle Dion; Yves Robert (Parallel Comput., 1996)

A Characterization of One-to-One Modular Mappings. - Alain Darte; Michèle Dion; Yves Robert (Parallel Process. Lett., 1996)

Code generation in bouclettes. - Pierre Boulet; Michèle Dion (PDP, 1997)