On the public citation graph
Reliable Generation of High-Performance Matrix 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/978-3-540-24644-2_11openalex-snapshot
Programming for Locality and Parallelism with Hierarchically Tiled Arrays
inferredcites →https://doi.org/10.1007/978-3-540-89740-8_24openalex-snapshot
Exploring the Optimization Space of Dense Linear Algebra Kernels
inferredcites →https://doi.org/10.1007/978-3-642-57172-5_1openalex-snapshot
A Modern Framework for Portable High-Performance Numerical Linear Algebra
inferredcites →https://doi.org/10.1007/s11227-006-7957-2openalex-snapshot
Automatic tuning of whole applications using direct search and a performance-based transformation system
inferredcites →https://doi.org/10.1016/j.jocs.2011.03.002openalex-snapshot
Modeling the memory and performance impacts of loop fusion
inferredcites →https://doi.org/10.1016/j.procs.2011.04.234openalex-snapshot
Can search algorithms save large-scale automatic performance tuning?
inferredcites →https://doi.org/10.1109/99.660313openalex-snapshot
OpenMP: an industry standard API for shared-memory programming
inferredcites →https://doi.org/10.1109/ipdps.2007.370637openalex-snapshot
POET: Parameterized Optimizations for Empirical Tuning
inferredcites →https://doi.org/10.1109/ipdps.2008.4536183openalex-snapshot
Build to order linear algebra kernels
inferredcites →https://doi.org/10.1109/ipdps.2009.5161004openalex-snapshot
Annotation-based empirical performance tuning using Orio
inferredcites →https://doi.org/10.1109/ipdps.2009.5161054openalex-snapshot
A scalable auto-tuning framework for compiler optimization
inferredcites →https://doi.org/10.1109/jproc.2004.840306openalex-snapshot
SPIRAL: Code Generation for DSP Transforms
inferredcites →https://doi.org/10.1109/jproc.2004.840311openalex-snapshot
Synthesis of High-Performance Parallel Programs for a Class of ab Initio Quantum Chemistry Models
inferredcites →https://doi.org/10.1109/sc.2010.14openalex-snapshot
Combined Iterative and Model-driven Optimization in an Automatic Parallelization Framework
inferredcites →https://doi.org/10.1145/1356052.1356055openalex-snapshot
Cache efficient bidiagonalization using BLAS 2.5 operators
inferredcites →https://doi.org/10.1145/1377603.1377607openalex-snapshot
High-performance implementation of the level-3 BLAS
inferredcites →https://doi.org/10.1145/1654059.1654119openalex-snapshot
Automating the generation of composed linear algebra kernels
inferredcites →https://doi.org/10.1145/1854273.1854317openalex-snapshot
A model for fusion and code motion in an automatic parallelizing compiler
inferredcites →https://doi.org/10.1145/1964218.1964226openalex-snapshot
Parallel memory prediction for fused linear algebra kernels
inferredcites →https://doi.org/10.1145/2382585.2382587openalex-snapshot
Families of Algorithms for Reducing a Matrix to Condensed Form
inferredcites →https://doi.org/10.1145/2464576.2466737openalex-snapshot
Introduction to genetic algorithms
inferredcites →https://doi.org/10.1145/258492.258520openalex-snapshot
Optimal weighted loop fusion for parallel programs
inferredcites →https://doi.org/10.1145/2591635.2667174openalex-snapshot
Optimizing matrix multiply using PHiPAC
inferredcites →https://doi.org/10.1145/263580.263662openalex-snapshot
Optimizing matrix multiply using PHiPAC
inferredcites →https://doi.org/10.1145/321406.321418openalex-snapshot
The Organization of Computations for Uniform Recurrence Equations
inferredcites →https://doi.org/10.1145/331532.331600openalex-snapshot
Achieving high sustained performance in an unstructured mesh CFD application
inferredcites →https://doi.org/10.1145/355841.355847openalex-snapshot
Basic Linear Algebra Subprograms for Fortran Usage
inferredcites →https://doi.org/10.1145/369028openalex-snapshot
Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '96
inferredcites →https://doi.org/10.1145/42288.42291openalex-snapshot
An extended set of FORTRAN basic linear algebra subprograms
inferredcites →https://doi.org/10.1145/567806.567807openalex-snapshot
An updated set of basic linear algebra subprograms (BLAS)
inferredcites →https://doi.org/10.1145/77626.79170openalex-snapshot
A set of level 3 basic linear algebra subprograms
inferredcites →https://doi.org/10.1145/93542openalex-snapshot
Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation - PLDI '90
inferredcites →https://doi.org/10.1177/1094342004041293openalex-snapshot
Statistical Models for Empirical Search-Based Performance Tuning
inferredcites →https://doi.org/10.1177/1094342013492178openalex-snapshot
A case study in mechanically deriving dense linear algebra code
inferredcites →https://doi.org/10.2172/890608openalex-snapshot
Parameterizing loop fusion for automated empirical tuning
inferredcites →https://doi.org/10.5555/509058.509096openalex-snapshot
Automatically Tuned Linear Algebra Software
inferredcites →https://doi.org/10.7551/mitpress/3927.001.0001openalex-snapshot
An Introduction to Genetic Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10766-016-0464-zopenalex-snapshot
GHOST: Building Blocks for High Performance Sparse Linear Algebra on Heterogeneous Systems
inferred← citeshttps://doi.org/10.1109/cgo57630.2024.10444787openalex-snapshot
A Tensor Algebra Compiler for Sparse Differentiation
inferred← citeshttps://doi.org/10.1109/jproc.2018.2873289openalex-snapshot
SPIRAL: Extreme Performance Portability
inferred← citeshttps://doi.org/10.1111/cgf.14080openalex-snapshot
EGGS: Sparsity‐Specific Code Generation
inferred← citeshttps://doi.org/10.1145/2544137.2544155openalex-snapshot
A Basic Linear Algebra Compiler
inferred← citeshttps://doi.org/10.1145/2774959.2774962openalex-snapshot
Abstract expressionism for parallel performance
inferred← citeshttps://doi.org/10.1145/3276493openalex-snapshot
Format abstraction for sparse tensor algebra compilers
inferred← citeshttps://doi.org/10.1145/3588717openalex-snapshot
Optimizing Tensor Programs on Flexible Storage
inferred← citeshttps://doi.org/10.48550/arxiv.1802.06504openalex-snapshot
Compiling Diderot: From Tensor Calculus to C
inferred← citeshttps://doi.org/10.48550/arxiv.2001.00532openalex-snapshot
A Unified Iteration Space Transformation Framework for Sparse and Dense Tensor Algebra
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.