On the public citation graph
Reshaping access patterns for generating sparse codes
0 signed · 40 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/3-540-57659-2_4openalex-snapshot
On automatic data structure selection and code generation for sparse computations
inferredcites →https://doi.org/10.1007/978-1-4613-1077-8openalex-snapshot
Parallel Programming and Compilers
inferredcites →https://doi.org/10.1007/978-1-4684-6894-6openalex-snapshot
Dependence Analysis for Supercomputing
inferredcites →https://doi.org/10.1007/b102311openalex-snapshot
Loop Transformations for Restructuring Compilers: The Foundations
inferredcites →https://doi.org/10.1007/bf01407876openalex-snapshot
Loops skewing: The wavefront method revisited
inferredcites →https://doi.org/10.1016/0097-3165(73)90004-6openalex-snapshot
Fourier-Motzkin elimination and its dual
inferredcites →https://doi.org/10.1016/0167-8191(90)90055-eopenalex-snapshot
Optimal code parallelization using unimodular transformations
inferredcites →https://doi.org/10.1093/acprof:oso/9780198508380.001.0001openalex-snapshot
Direct Methods for Sparse Matrices
inferredcites →https://doi.org/10.1109/71.97902openalex-snapshot
A loop transformation theory and an algorithm to maximize parallelism
inferredcites →https://doi.org/10.1145/108556.108582openalex-snapshot
Algorithm 692: Model implementation and test package for the Sparse Basic Linear Algebra Subprograms
inferredcites →https://doi.org/10.1145/109625.109631openalex-snapshot
Scanning polyhedra with DO loops
inferredcites →https://doi.org/10.1145/109626.109631openalex-snapshot
Scanning polyhedra with DO loops
inferredcites →https://doi.org/10.1145/113445.113449openalex-snapshot
A data locality optimizing algorithm
inferredcites →https://doi.org/10.1145/165939.166023openalex-snapshot
Compilation techniques for sparse matrix computations
inferredcites →https://doi.org/10.1145/169627.169765openalex-snapshot
Advanced compiler optimizations for sparse computations
inferredcites →https://doi.org/10.1145/29873.29875openalex-snapshot
Automatic translation of FORTRAN programs to vector form
inferredcites →https://doi.org/10.1145/3392717.3400034openalex-snapshot
Optimizing supercompilers for supercomputers
inferredcites →https://doi.org/10.1145/355791.355796openalex-snapshot
Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
inferredcites →https://doi.org/10.1145/362575.362584openalex-snapshot
Algorithm 408: a sparse matrix package (part I) [F4]
inferredcites →https://doi.org/10.1145/7902.7904openalex-snapshot
Advanced compiler optimizations for supercomputers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0048openalex-snapshot
The Use of Iteration Space Partitioning to Construct Representative Simple Sections
inferred← citeshttps://doi.org/10.1007/11573937_3openalex-snapshot
A Data Transformations Based Approach for Optimizing Memory and Cache Locality on Distributed Memory Multiprocessors
inferred← citeshttps://doi.org/10.1007/3-540-48319-5_14openalex-snapshot
SIPR: A New Framework for Generating Efficient Code for Sparse Matrix Computations
inferred← citeshttps://doi.org/10.1007/3-540-61142-8_586openalex-snapshot
Iteration space partitioning
inferred← citeshttps://doi.org/10.1007/bfb0014219openalex-snapshot
Automatic parallelization of the conjugate gradient algorithm
inferred← citeshttps://doi.org/10.1007/s10766-008-0085-2openalex-snapshot
A Compile/Run-time Environment for the Automatic Transformation of Linked List Data Structures
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/j.jpdc.2004.12.004openalex-snapshot
Improving whole-program locality using intra-procedural and inter-procedural transformations
inferred← citeshttps://doi.org/10.1016/s0167-739x(96)00027-1openalex-snapshot
Iteration space partitioning
inferred← citeshttps://doi.org/10.1109/71.485501openalex-snapshot
Automatic data structure selection and transformation for sparse matrix computations
inferred← citeshttps://doi.org/10.1109/apsit52773.2021.9641231openalex-snapshot
Application of Data Structure Algorithm For Sparse Matrix Computation in Power System
inferred← citeshttps://doi.org/10.1109/ispan.2000.900289openalex-snapshot
Efficient parallel algorithms for multi-dimensional matrix operations
inferred← citeshttps://doi.org/10.1145/263580.263630openalex-snapshot
Sparse code generation for imperfectly nested loops with dependences
inferred← citeshttps://doi.org/10.1145/360204.360219openalex-snapshot
A compiler technique for improving whole-program locality
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.