On the complexity of loop fusion

This publication has 12 references indexed in Scilit:

• A compiler algorithm to reduce invalidation latency in virtual shared memory systems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Loop parallelization algorithms: From parallelism extraction to code generation
  Parallel Computing, 1998
• Optimal weighted loop fusion for parallel programs
  Published by Association for Computing Machinery (ACM) ,1997
• Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs
  International Journal of Parallel Programming, 1997
• More on the complexity of common superstring and supersequence problems
  Theoretical Computer Science, 1994
• Maximizing loop parallelism and improving data locality via loop fusion and distribution
  Published by Springer Nature ,1994
• Collective loop fusion for array contraction
  Published by Springer Nature ,1993
• Routing Printed Circuit Cards Through an Assembly Cell
  Operations Research, 1991
• Automatic translation of FORTRAN programs to vector form
  ACM Transactions on Programming Languages and Systems, 1987
• The Complexity of Some Problems on Subsequences and Supersequences
  Journal of the ACM, 1978