On the public citation graph

Finding legal reordering transformations using mappings

https://doi.org/10.1007/bfb0025874
0 signed · 49 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.
Claim with ORCID
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.
See reference health

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/978-1-4613-1077-8openalex-snapshot
Parallel Programming and Compilers
inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/bf00925828openalex-snapshot
The ALPHA language and its use for the design of systolic arrays
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.1016/0004-3702(80)90026-0openalex-snapshot
Principles of artificial intelligence
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1109/71.298207openalex-snapshot
Constructive methods for scheduling uniform loop nests
inferredcites →https://doi.org/10.1109/71.342135openalex-snapshot
Going beyond integer programming with the Omega test to eliminate false data dependences
inferredcites →https://doi.org/10.1109/fmpc.1995.380437openalex-snapshot
Code generation for multiple mappings
inferredcites →https://doi.org/10.1145/109025.109108openalex-snapshot
Uniform techniques for loop optimization
inferredcites →https://doi.org/10.1145/113445.113449openalex-snapshot
A data locality optimizing algorithm
inferredcites →https://doi.org/10.1145/125826.125848openalex-snapshot
The Omega test: a fast and practical integer programming algorithm for 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/3392717.3400034openalex-snapshot
Optimizing supercompilers for supercomputers
inferredcites →https://doi.org/10.1145/76263.76337openalex-snapshot
More iteration space tiling
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.5555/147877.147997openalex-snapshot
Non-unimodular transformations of nested loops

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4419-9359-5_8openalex-snapshot
Parameterized Program Equivalence Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-19861-8_15openalex-snapshot
Practical Loop Transformations for Tensor Contraction Expressions on Multi-level Memory Hierarchies
inferred← citeshttps://doi.org/10.1007/bf02577771openalex-snapshot
Minimal data dependence abstractions for loop transformations: Extended version
inferred← citeshttps://doi.org/10.1007/bf03356760openalex-snapshot
Transitive Closure of Infinite Graphs and Its Applications
inferred← citeshttps://doi.org/10.1007/bfb0014196openalex-snapshot
Transitive closure of infinite graphs and its applications
inferred← citeshttps://doi.org/10.1016/j.parco.2016.02.004openalex-snapshot
An approach for code generation in the Sparse Polyhedral Framework
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00313-8openalex-snapshot
A theoretical foundation for program transformations to reduce cache thrashing due to true data sharing
inferred← citeshttps://doi.org/10.1023/a:1012293814832openalex-snapshot
Synthesizing Transformations for Locality Enhancement of Imperfectly-Nested Loop Nests
inferred← citeshttps://doi.org/10.1049/iet-cdt.2009.0089openalex-snapshot
On-chip memory space partitioning for chip multiprocessors using polyhedral algebra
inferred← citeshttps://doi.org/10.1109/aspdac.2005.1466448openalex-snapshot
Customized on-chip memories for embedded chip multiprocessors
inferred← citeshttps://doi.org/10.1109/aspdac.2005.1466454openalex-snapshot
Using data replication to reduce communication energy on chip multiprocessors
inferred← citeshttps://doi.org/10.1109/aspdac.2006.1594785openalex-snapshot
Maximizing data reuse for minimizing memory space requirements and execution cycles
inferred← citeshttps://doi.org/10.1109/fmpc.1995.380437openalex-snapshot
Code generation for multiple mappings
inferred← citeshttps://doi.org/10.1109/icapp.1995.472180openalex-snapshot
A unifying framework for iteration reordering transformations
inferred← citeshttps://doi.org/10.1109/iccl.1998.674176openalex-snapshot
Loop optimization for aggregate array computations
inferred← citeshttps://doi.org/10.1109/isvlsi.2006.22openalex-snapshot
An integer linear programming based approach to simultaneous memory space partitioning and data allocation for chip multiprocessors
inferred← citeshttps://doi.org/10.1145/1023833.1023838openalex-snapshot
Dynamic on-chip memory management for chip multiprocessors
inferred← citeshttps://doi.org/10.1145/1053468.1053471openalex-snapshot
Optimizing aggregate array computations in loops
inferred← citeshttps://doi.org/10.1145/1118299.1118484openalex-snapshot
Maximizing data reuse for minimizing memory space requirements and execution cycles
inferred← citeshttps://doi.org/10.1145/1120725.1121008openalex-snapshot
Customized on-chip memories for embedded chip multiprocessors
inferred← citeshttps://doi.org/10.1145/1120725.1121013openalex-snapshot
Using data replication to reduce communication energy on chip multiprocessors
inferred← citeshttps://doi.org/10.1145/1542476.1542513openalex-snapshot
Proving optimizations correct using parameterized program equivalence
inferred← citeshttps://doi.org/10.1145/2591635.2667179openalex-snapshot
Synthesizing transformations for locality enhancement of imperfectly-nested loop nests
inferred← citeshttps://doi.org/10.1145/277044.277198openalex-snapshot
Making complex timing relationships readable
inferred← citeshttps://doi.org/10.1145/378795.378859openalex-snapshot
Exact analysis of the cache behavior of nested loops
inferred← citeshttps://doi.org/10.1145/780822.781142openalex-snapshot
Compile-time composition of run-time data and iteration reorderings
inferred← citeshttps://doi.org/10.1177/1094342004041294openalex-snapshot
Sparse Tiling for Stationary Iterative Methods
inferred← citeshttps://doi.org/10.70675/ae2e80ddz5505z493dz8f00zbded07e27060openalex-snapshot
Efficient search-based strategies for polyhedral compilation : algorithms and experience in a production compiler
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.