On the public citation graph
Solving alignment using elementary linear algebra
0 signed · 50 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-2openalex-snapshot
Languages and Compilers for Parallel Computing
inferredcites →https://doi.org/10.1007/3-540-57659-2_14openalex-snapshot
The alignment-distribution graph
inferredcites →https://doi.org/10.1007/978-3-662-02945-9openalex-snapshot
A Course in Computational Algebraic Number Theory
inferredcites →https://doi.org/10.1007/b102311openalex-snapshot
Loop Transformations for Restructuring Compilers: The Foundations
inferredcites →https://doi.org/10.1007/bfb0038665openalex-snapshot
Communication-free hyperplane partitioning of nested loops
inferredcites →https://doi.org/10.1109/fmpc.1990.89492openalex-snapshot
Data optimization: minimizing residual interprocessor data motion on SIMD machines
inferredcites →https://doi.org/10.1109/fmpc.1990.89493openalex-snapshot
Index domain alignment: minimizing cost of cross-referencing between distributed arrays
inferredcites →https://doi.org/10.1137/0910073openalex-snapshot
Krylov Subspace Methods on Supercomputers
inferredcites →https://doi.org/10.1142/s0129626494000235openalex-snapshot
TOWARD AUTOMATIC DISTRIBUTION
inferredcites →https://doi.org/10.1145/155090.155101openalex-snapshot
Global optimizations for parallelism and locality on scalable parallel machines
inferredcites →https://doi.org/10.1145/200994.201004openalex-snapshot
Optimal evaluation of array expressions on massively parallel machines
inferredcites →https://doi.org/10.6028/jres.071b.033openalex-snapshot
Systems of distinct representatives and linear algebra
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11576235_48openalex-snapshot
Communication-Free Data Alignment for Arrays with Exponential References Using Elementary Linear Algebra
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_52openalex-snapshot
Scheduling the Computations of a Loop Nest with Respect to a Given Mapping
inferred← citeshttps://doi.org/10.1007/3-540-45403-9_12openalex-snapshot
A Compilation Method for Communication-Efficient Partitioning of DOALL Loops
inferred← citeshttps://doi.org/10.1007/3-540-45403-9_13openalex-snapshot
Compiler Optimization of Dynamic Data Distributions for Distributed-Memory Multicomputers
inferred← citeshttps://doi.org/10.1007/3-540-48319-5_10openalex-snapshot
Fortran RED — A Retargetable Environment for Automatic Data Layout
inferred← citeshttps://doi.org/10.1007/3-540-48319-5_20openalex-snapshot
Automatic Analysis of Loops to Exploit Operator Parallelism on Reconfigurable Systems
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_60openalex-snapshot
Solving the constant-degree parallelism alignment problem
inferred← citeshttps://doi.org/10.1007/bfb0014211openalex-snapshot
Recovering logical structures of data
inferred← citeshttps://doi.org/10.1007/bfb0014219openalex-snapshot
Automatic parallelization of the conjugate gradient algorithm
inferred← citeshttps://doi.org/10.1007/bfb0097884openalex-snapshot
Efficient program partitioning based on compiler controlled communication
inferred← citeshttps://doi.org/10.1007/s10766-004-1460-2openalex-snapshot
Automatic Array Partitioning Based on the Smith Normal Form
inferred← citeshttps://doi.org/10.1007/s11227-006-6615-zopenalex-snapshot
An Efficient Communication Scheduling Method for the Processor Mapping Technique Applied Data Redistribution
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00025-8openalex-snapshot
Tools and techniques for automatic data layout: A case study
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00086-1openalex-snapshot
Compilation techniques for parallel systems
inferred← citeshttps://doi.org/10.1023/a:1011144404437openalex-snapshot
Communication-Free Alignment for Array References with Linear Subscripts in Three Loop Index Variables or Quadratic Subscripts
inferred← citeshttps://doi.org/10.1023/a:1018744411700openalex-snapshot
Nonsingular Data Transformations: Definition, Validity, and Applications
inferred← citeshttps://doi.org/10.1023/a:1023857207116openalex-snapshot
Distribution of Operations and Data Arrays over Processors
inferred← citeshttps://doi.org/10.1109/71.980026openalex-snapshot
Automatic compilation of loops to exploit operator parallelism on configurable arithmetic logic units
inferred← citeshttps://doi.org/10.1109/asap.1997.606840openalex-snapshot
Automatic data mapping of signal processing applications
inferred← citeshttps://doi.org/10.1109/hicss.1995.375472openalex-snapshot
Automatic data and computation decomposition for distributed memory machines
inferred← citeshttps://doi.org/10.1109/hicss.1997.667406openalex-snapshot
The alignment problem in a linear algebra framework
inferred← citeshttps://doi.org/10.1109/icapp.2002.1173583openalex-snapshot
Redundant computation partition on distributed-memory systems
inferred← citeshttps://doi.org/10.1109/icpp.1996.538557openalex-snapshot
A compile time partitioning method for DOALL loops on distributed memory systems
inferred← citeshttps://doi.org/10.1109/icpp.1999.797391openalex-snapshot
Access descriptor based locality analysis for Distributed-Shared Memory multiprocessors
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016578openalex-snapshot
Next generation system software for future high-end computing systems
inferred← citeshttps://doi.org/10.1109/pact.1996.552656openalex-snapshot
A heuristic approach for finding a solution to the constant-degree parallelism alignment problem
inferred← citeshttps://doi.org/10.1109/pact.1997.644018openalex-snapshot
Two techniques for static array partitioning on message-passing parallel machines
inferred← citeshttps://doi.org/10.1109/pact.1999.807573openalex-snapshot
Efficient parallelisation using combined loop and data transformations
inferred← citeshttps://doi.org/10.1109/spdp.1995.530708openalex-snapshot
A communication+computation load balanced loop partitioning method
inferred← citeshttps://doi.org/10.1109/tpds.2003.1206503openalex-snapshot
Compiler techniques for the distribution of data and computation
inferred← citeshttps://doi.org/10.1109/tpds.2004.1264783openalex-snapshot
Using elementary linear algebra to solve data alignment for arrays with linear or quadratic references
inferred← citeshttps://doi.org/10.1145/224170.224495openalex-snapshot
Automatic data layout for high performance Fortran
inferred← citeshttps://doi.org/10.1145/3620666.3651357openalex-snapshot
PrimePar: Efficient Spatial-temporal Tensor Partitioning for Large Transformer Model Training
inferred← citeshttps://doi.org/10.1145/509593.509603openalex-snapshot
Compiling parallel code for sparse matrix applications
inferred← citeshttps://doi.org/10.1201/9781420040579.ch12openalex-snapshot
Automatic Data Distribution
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.6181openalex-snapshot
Automatic Data and Computation Mapping for Distributed-Memory Machines.
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.