Search the dblp DataBase
Michèle Dion: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Michèle Dion, Marc Gengler, Stéphane Ubéda
Comparing two Probabilistic Models of the Computational Complexity of the Branch and Bound Algorithm. [Citation Graph (0, 0)][DBLP]
CONPAR, 1994, pp:359-370 [Conf] - Michèle Dion
Affine Data Mapping with Residual Communication Optimization: Evaluation of Heuristics. [Citation Graph (0, 0)][DBLP]
HPCN Europe, 1996, pp:654-661 [Conf] - Michèle Dion, Yves Robert
Mapping affine loop nests: new results. [Citation Graph (0, 0)][DBLP]
HPCN Europe, 1995, pp:184-189 [Conf] - Michèle Dion, Yves Robert, Jean-Laurent Philippe
Parallelizing Compilers: What Can Be Achieved? [Citation Graph (0, 0)][DBLP]
HPCN, 1994, pp:447-456 [Conf] - Michèle Dion, Cyril Randriamaro, Yves Robert
How to Optimize Residual Communications? [Citation Graph (0, 0)][DBLP]
IPPS, 1996, pp:382-391 [Conf] - Michèle Dion, Tanguy Risset, Yves Robert
Resource-constrained scheduling of partitioned algorithms on processor arrays. [Citation Graph (0, 0)][DBLP]
PDP, 1995, pp:571-580 [Conf] - Michèle Dion, Cyril Randriamaro, Yves Robert
Compiling Affine Nested Loops: How to Optimize the Residual Communications after the Alignment Phase. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 1996, v:38, n:2, pp:176-187 [Journal] - Michèle Dion, Yves Robert
Mapping Affine Loop Nests. [Citation Graph (0, 0)][DBLP]
Parallel Computing, 1996, v:22, n:10, pp:1373-1397 [Journal]
Search in 0.003secs, Finished in 0.003secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002