On the public citation graph
Specializing Compiler Optimizations through Programmable Composition for Dense Matrix Computations
0 signed · 48 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.1002/spe.1089openalex-snapshot
POET: a scripting language for applying parameterized source‐to‐source program transformations
inferredcites →https://doi.org/10.1002/spe.4380240104openalex-snapshot
Scalar replacement in the presence of conditional control flow
inferredcites →https://doi.org/10.1109/cgo.2005.10openalex-snapshot
Combining Models and Guided Empirical Search to Optimize for Multiple Levels of the Memory Hierarchy
inferredcites →https://doi.org/10.1109/cgo.2005.33openalex-snapshot
Superword-Level Parallelism in the Presence of Control Flow
inferredcites →https://doi.org/10.1109/cgo.2006.25openalex-snapshot
Multi-platform Auto-vectorization
inferredcites →https://doi.org/10.1109/cgo.2011.5764678openalex-snapshot
Automated programmable control and parameterization of compiler optimizations
inferredcites →https://doi.org/10.1109/cgo.2011.5764679openalex-snapshot
Extendable pattern-oriented optimization directives
inferredcites →https://doi.org/10.1109/ipdps.2003.1213377openalex-snapshot
ECO: an empirical-based compilation and optimization system
inferredcites →https://doi.org/10.1109/isca.1995.524546openalex-snapshot
The SPLASH-2 programs: characterization and methodological considerations
inferredcites →https://doi.org/10.1109/pact.2004.1342537openalex-snapshot
Code generation in the polyhedral model is easier than you think
inferredcites →https://doi.org/10.1109/sc.1998.10004openalex-snapshot
Automatically Tuned Linear Algebra Software
inferredcites →https://doi.org/10.1137/1017068openalex-snapshot
Society for Industrial and Applied Mathematics
inferredcites →https://doi.org/10.1137/1019132openalex-snapshot
Society for Industrial and Applied Mathematics
inferredcites →https://doi.org/10.1145/106972.106981openalex-snapshot
The cache performance and optimizations of blocked algorithms
inferredcites →https://doi.org/10.1145/1088149.1088169openalex-snapshot
Facilitating the search for compositions of program transformations
inferredcites →https://doi.org/10.1145/1152154.1152182openalex-snapshot
Fast, automatic, procedure-level performance tuning
inferredcites →https://doi.org/10.1145/1375581.1375595openalex-snapshot
A practical automatic polyhedral parallelizer and locality optimizer
inferredcites →https://doi.org/10.1145/1512762.1512773openalex-snapshot
Automated transformation for performance-critical kernels
inferredcites →https://doi.org/10.1145/1654059.1654119openalex-snapshot
Automating the generation of composed linear algebra kernels
inferredcites →https://doi.org/10.1145/1944862.1944880openalex-snapshot
Automated empirical tuning of scientific codes for performance and power consumption
inferredcites →https://doi.org/10.1145/197320.197366openalex-snapshot
Improving the ratio of memory operations to floating-point operations in loops
inferredcites →https://doi.org/10.1145/233561.233564openalex-snapshot
Improving data locality with loop transformations
inferredcites →https://doi.org/10.1145/258915.258946openalex-snapshot
Data-centric multi-level blocking
inferredcites →https://doi.org/10.1145/258916.258946openalex-snapshot
Data-centric multi-level blocking
inferredcites →https://doi.org/10.1145/2591635.2667179openalex-snapshot
Synthesizing transformations for locality enhancement of imperfectly-nested loop nests
inferredcites →https://doi.org/10.1145/305138.305197openalex-snapshot
An affine partitioning algorithm to maximize parallelism and minimize communication
inferredcites →https://doi.org/10.1145/335231.335245openalex-snapshot
Synthesizing transformations for locality enhancement of imperfectly-nested loop nests
inferredcites →https://doi.org/10.1145/780731.780735openalex-snapshot
Finding effective optimization phase sequences
inferredcites →https://doi.org/10.1145/780732.780735openalex-snapshot
Finding effective optimization phase sequences
inferredcites →https://doi.org/10.1145/996841.996853openalex-snapshot
Vectorization for SIMD architectures with alignment constraints
inferredcites →https://doi.org/10.5555/2190025.2190057openalex-snapshot
Automated programmable control and parameterization of compiler optimizations
inferredcites →https://doi.org/10.5555/2190025.2190058openalex-snapshot
Extendable pattern-oriented optimization directives
inferredcites →https://doi.org/10.5555/509058.509096openalex-snapshot
Automatically Tuned Linear Algebra Software
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-3-319-29778-1_6openalex-snapshot
Interactive Composition of Compiler Optimizations
inferred← citeshttps://doi.org/10.1007/s10766-021-00722-1openalex-snapshot
Enhancing the Effectiveness of Inlining in Automatic Parallelization
inferred← citeshttps://doi.org/10.1109/cgo.2017.7863734openalex-snapshot
Automatic generation of fast BLAS3-GEMM: A portable compiler approach
inferred← citeshttps://doi.org/10.1145/3225058.3225132openalex-snapshot
Improving Resource Utilization through Demand Aware Process Scheduling
inferred← citeshttps://doi.org/10.1145/3235029openalex-snapshot
High-Performance Generalized Tensor Operations
inferred← citeshttps://doi.org/10.1145/3545008.3545031openalex-snapshot
Automatically Generating High-performance Matrix Multiplication Kernels on the Latest Sunway Processor
inferred← citeshttps://doi.org/10.1360/n112019-00050openalex-snapshot
Selection of compiler-optimization sequences
inferred← citeshttps://doi.org/10.14529/cmse200202openalex-snapshot
Optimization Methods for Generalized Tensor Contraction
inferred← citeshttps://doi.org/10.3390/electronics7120359openalex-snapshot
Hybrid-Grained Dynamic Load Balanced GEMM on NUMA Architectures
inferred← citeshttps://doi.org/10.5555/3049832.3049846openalex-snapshot
Automatic generation of fast BLAS3-GEMM: a portable compiler approach
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.