On the public citation graph
The loop parallelizer LooPo—announcement
0 signed · 31 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-57208-2_28openalex-snapshot
Loop parallelization in the polytope model
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/bfb0046628openalex-snapshot
Mapping affine loop nests: New results
inferredcites →https://doi.org/10.1051/ro/1988220302431openalex-snapshot
Parametric integer programming
inferredcites →https://doi.org/10.1109/aispas.1995.401360openalex-snapshot
On the parallelization of loop nests containing while loops
inferredcites →https://doi.org/10.1142/s0129626494000235openalex-snapshot
TOWARD AUTOMATIC DISTRIBUTION
inferredcites →https://doi.org/10.1145/360827.360844openalex-snapshot
The parallel execution of DO loops
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.772openalex-snapshot
Space–time mapping and tiling: a helpful combination
inferred← citeshttps://doi.org/10.1007/3-540-44905-1_14openalex-snapshot
Application of the Polytope Model to Functional Programs
inferred← citeshttps://doi.org/10.1007/3-540-45706-2_40openalex-snapshot
On the Equivalence of Two Systems of Affine Recurrence Equations
inferred← citeshttps://doi.org/10.1007/3-540-45874-3_7openalex-snapshot
Structured Scheduling of Recurrence Equations: Theory and Practice
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00063-0openalex-snapshot
Termination detection in parallel loop nests with while loops
inferred← citeshttps://doi.org/10.1023/a:1007904422322openalex-snapshot
The Static Parallelization of Loops and Recursions
inferred← citeshttps://doi.org/10.1109/aiccsa.2017.168openalex-snapshot
An Overview on Loop Tiling Techniques for Code Generation
inferred← citeshttps://doi.org/10.1109/ase.2013.6693108openalex-snapshot
The potential of polyhedral optimization: An empirical study
inferred← citeshttps://doi.org/10.1109/pact.1998.727179openalex-snapshot
Code generation in the polytope model
inferred← citeshttps://doi.org/10.1109/synasc.2008.33openalex-snapshot
On Computing Solutions of Linear Diophantine Equations with One Non-linear Parameter
inferred← citeshttps://doi.org/10.1142/s0129626412500107openalex-snapshot
POLLY — PERFORMING POLYHEDRAL OPTIMIZATIONS ON A LOW-LEVEL INTERMEDIATE REPRESENTATION
inferred← citeshttps://doi.org/10.1145/2675359openalex-snapshot
Improving Multibank Memory Access Parallelism with Lattice-Based Partitioning
inferred← citeshttps://doi.org/10.1145/3177961openalex-snapshot
Visual Program Manipulation in the Polyhedral Model
inferred← citeshttps://doi.org/10.1145/365151.365152openalex-snapshot
Optimizing memory usage in the polyhedral model
inferred← citeshttps://doi.org/10.1504/ijcse.2005.009695openalex-snapshot
Foundations for the integration of scheduling techniques into compilers for parallel languages
inferred← citeshttps://doi.org/10.32362/2500-316x-2019-7-5-7-19openalex-snapshot
A tool for automatic parallelization of affine programs for systems with shared and distributed memory
inferred← citeshttps://doi.org/10.5555/2755753.2755789openalex-snapshot
Interplay of loop unrolling and multidimensional memory partitioning in HLS
inferred← citeshttps://doi.org/10.5555/522344.825673openalex-snapshot
Code generation in the polytope model
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.