J. R. Allen and K. Kennedy, Automatic translation of Fortran programs to vector form, ACM Transactions on Programming Languages and Systems, vol.9, issue.4, p.4911542, 1987.

P. Boulet, A. Darte, G. Silber, and F. Vivien, Loop parallelization algorithms: from parallelism extraction to code generation, Special issue on Languages and Compilers for Parallel Computers, vol.24, 1998.
URL : https://hal.archives-ouvertes.fr/hal-02101883

D. Callahan, A G l o b al Approach to Detec t i o n o f P a r allelism, vol.8, p.7

A. Darte and F. Vivien, Optimal ne and medium grain parallelism detection in polyhedral reduced dependence graphs, International Journal of Parallel Programming, vol.25, issue.6, p.4477497, 1997.

G. Gao, R. Olsen, V. Sarkar, and R. Thekkath, Collective loop fusion for array contraction, The 5th Workshop on Languages and Compiler for Parallelism, n umber 757 in Lecture Notes in Computer Science, p.2811295, 1992.

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability, a guide to the theory of NP-completeness, W . H . F reeman and Company, pp.1-9

K. Kennedy and K. S. Mckinley, Typed Fusion with Applications to Parallel and Sequential Code Generation, pp.1-9

C. B. Lofgren, L. F. Mcginnis, and C. A. Tovey, Routing printed circuit cards through an assembly cell, Operations Research, vol.39, issue.6, p.99221004, 1991.

D. Maier, The complexity of some problems on subsequences and supersequences, Journal of the ACM, vol.25, issue.2, p.3222336, 1978.

K. S. Mckinley and K. Kennedy, Maximizing Loop Parallelism and Improving Data Locality via Loop Fusion and Distribution, The Sixth Annual Languages and Compiler for Parallelism Workshop, n umber 768 in Lecture Notes in Computer Science, p.3011320, 1993.

M. Middendorf, More on the complexity of common superstring and supersequence problems, Theoretical Computer Science, vol.125, p.2055228, 1994.

M. F. Boyle, A. P. Nisbet, and R. W. Ford, A compiler algorithm to reduce invalidation latency in virtual shared memory systems, Proceedings of PACT'96, 1996.

C. Picouleau, Two new NP-complete scheduling problems with communication delays and unlimited number of processors, IBP, 1991.

K. Rrihh and E. Ukkonen, The shortest common supersequence problem over binary alphabet is NP-complete, Theoretical Computer Science, vol.16, p.1877198, 1981.

M. Wolfe, High Performance Compilers for Parallel Computing. A ddison-Wesley, 1996.