On the public citation graph
Minimal data dependence abstractions for loop transformations: Extended version
0 signed · 36 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-57502-2_60openalex-snapshot
A singular loop transformation framework based on non-singular matrices
inferredcites →https://doi.org/10.1007/b102311openalex-snapshot
Loop Transformations for Restructuring Compilers: The Foundations
inferredcites →https://doi.org/10.1007/bf01379404openalex-snapshot
Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time
inferredcites →https://doi.org/10.1007/bf01407835openalex-snapshot
Some efficient solutions to the affine scheduling problem. I. One-dimensional time
inferredcites →https://doi.org/10.1007/bf01407931openalex-snapshot
Dataflow analysis of array and scalar references
inferredcites →https://doi.org/10.1007/bfb0025874openalex-snapshot
Finding legal reordering transformations using mappings
inferredcites →https://doi.org/10.1109/12.90251openalex-snapshot
Time optimal linear schedules for algorithms with uniform dependencies
inferredcites →https://doi.org/10.1109/71.97902openalex-snapshot
A loop transformation theory and an algorithm to maximize parallelism
inferredcites →https://doi.org/10.1109/pgec.1966.264565openalex-snapshot
Analysis of Programs for Parallel Processing
inferredcites →https://doi.org/10.1145/109025.109086openalex-snapshot
Semantical interprocedural parallelization
inferredcites →https://doi.org/10.1145/109025.109104openalex-snapshot
Experiences with data dependence abstractions
inferredcites →https://doi.org/10.1145/113445.113447openalex-snapshot
Efficient and exact data dependence analysis
inferredcites →https://doi.org/10.1145/135226.135233openalex-snapshot
A practical algorithm for exact array dependence analysis
inferredcites →https://doi.org/10.1145/143095.143132openalex-snapshot
A general framework for iteration-reordering loop transformations
inferredcites →https://doi.org/10.1145/158511.158515openalex-snapshot
Array-data flow analysis and its use in array privatization
inferredcites →https://doi.org/10.1145/2591635.2667163openalex-snapshot
Semantical interprocedural parallelization
inferredcites →https://doi.org/10.1145/29873.29875openalex-snapshot
Automatic translation of FORTRAN programs to vector form
inferredcites →https://doi.org/10.1145/321406.321418openalex-snapshot
The Organization of Computations for Uniform Recurrence Equations
inferredcites →https://doi.org/10.1145/3392717.3400034openalex-snapshot
Optimizing supercompilers for supercomputers
inferredcites →https://doi.org/10.1145/360827.360844openalex-snapshot
The parallel execution of DO loops
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_50openalex-snapshot
On the optimality of Allen and Kennedy's algorithm for parallelism extraction in nested loops
inferred← citeshttps://doi.org/10.1007/978-3-319-17473-0_9openalex-snapshot
An Approach for Proving the Correctness of Inspector/Executor Transformations
inferred← citeshttps://doi.org/10.1007/s11227-011-0660-yopenalex-snapshot
Data locality optimization of interference graphs based on polyhedral computations
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00020-9openalex-snapshot
Loop parallelization algorithms: From parallelism extraction to code generation
inferred← citeshttps://doi.org/10.1080/01495739708941417openalex-snapshot
ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS
inferred← citeshttps://doi.org/10.1080/07408179808966433openalex-snapshot
A formalism to structure and parallelize the integration of cooperative engineering design tasks
inferred← citeshttps://doi.org/10.1093/comjnl/40.6.322openalex-snapshot
Unique Sets Oriented Parallelization of Loops with Non-uniform Dependences
inferred← citeshttps://doi.org/10.1109/hips.1998.665147openalex-snapshot
Further results for improving loop interchange in non-adjacent and imperfectly nested loops
inferred← citeshttps://doi.org/10.1109/icpp.1996.538558openalex-snapshot
Unique sets oriented partitioning of nested loops with non-uniform dependences
inferred← citeshttps://doi.org/10.1145/2591635.2591645openalex-snapshot
Author retrospective for semantical interprocedural parallelization
inferred← citeshttps://doi.org/10.1145/2892208.2892216openalex-snapshot
Mapping deviation: a technique to adapt or to guard loop transformation intuitions for legality
inferred← citeshttps://doi.org/10.1145/354880.354886openalex-snapshot
A preprocessing step for global loop transformations for data transfer optimization
inferred← citeshttps://doi.org/10.70675/d6848fa8z8279z4addzbe70zd3aeb8bf1959openalex-snapshot
Configurable Polyhedral Scheduling for All-Scenario Deep Learning Compilers
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.