On the public citation graph

A relational approach to the compilation of sparse matrix programs

0 signed · 64 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.1006/jpdc.1995.1141openalex-snapshot
Advanced Compiler Optimizations for Sparse Computations
inferredcites →https://doi.org/10.1007/978-3-662-02945-9openalex-snapshot
A Course in Computational Algebraic Number Theory
inferredcites →https://doi.org/10.1016/0378-4754(86)90036-4openalex-snapshot
Introduction to applied mathematics.
inferredcites →https://doi.org/10.1016/b978-0-12-799957-9.00002-xopenalex-snapshot
Database Management Systems
inferredcites →https://doi.org/10.1016/c2013-0-11311-6openalex-snapshot
Sparse Matrix Technology
inferredcites →https://doi.org/10.1109/71.485501openalex-snapshot
Automatic data structure selection and transformation for sparse matrix computations
inferredcites →https://doi.org/10.1115/1.3171799openalex-snapshot
Introduction to Applied Mathematics
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/161541.159766openalex-snapshot
Access normalization
inferredcites →https://doi.org/10.2172/531072openalex-snapshot
BlockSolve95 users manual: Scalable library software for the parallel solution of sparse linear systems
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.
inferredcites →https://doi.org/10.5860/choice.26-5107openalex-snapshot
Principles of database and knowledge-base systems

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.857openalex-snapshot
On the conditions necessary for removing abstraction penalties in O O L A L A
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/978-3-031-31445-2_2openalex-snapshot
Tensor Iterators for Flexible High-Performance Tensor Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-67295-3_2openalex-snapshot
Can Parallel Programming Revolutionize EDA Tools?
inferred← citeshttps://doi.org/10.1007/bfb0097985openalex-snapshot
Sparse computations with Pei
inferred← citeshttps://doi.org/10.1007/s00778-007-0071-0openalex-snapshot
Flexible and efficient IR using array databases
inferred← citeshttps://doi.org/10.1007/s10009-013-0287-9openalex-snapshot
Algorithmic program synthesis: introduction
inferred← citeshttps://doi.org/10.1023/a:1011172104768openalex-snapshot
Data-Centric Transformations for Locality Enhancement
inferred← citeshttps://doi.org/10.1109/12.990130openalex-snapshot
Efficient representation scheme for multidimensional array operations
inferred← citeshttps://doi.org/10.1109/cgo.2019.8661185openalex-snapshot
Tensor Algebra Compilation with Workspaces
inferred← citeshttps://doi.org/10.1109/cgo53902.2022.9741282openalex-snapshot
Unified Compilation for Lossless Compression and Sparse Computing
inferred← citeshttps://doi.org/10.1109/correctness49594.2019.00010openalex-snapshot
Bounded Verification of Sparse Matrix Computations
inferred← citeshttps://doi.org/10.1109/cw.2002.1180861openalex-snapshot
Efficient data compression methods for multi-dimensional sparse array operations
inferred← citeshttps://doi.org/10.1109/ia3.2016.011openalex-snapshot
Compiler Transformation to Generate Hybrid Sparse Computations
inferred← citeshttps://doi.org/10.1109/icpads.2016.0138openalex-snapshot
ICE: A General and Validated Energy Complexity Model for Multithreaded Algorithms
inferred← citeshttps://doi.org/10.1109/ispan.2000.900289openalex-snapshot
Efficient parallel algorithms for multi-dimensional matrix operations
inferred← citeshttps://doi.org/10.1109/jproc.2018.2857721openalex-snapshot
The Sparse Polyhedral Framework: Composing Compiler-Generated Inspector-Executor Code
inferred← citeshttps://doi.org/10.1109/sc.2000.10033openalex-snapshot
A Framework for Sparse Matrix Code Synthesis from High-level Specifications
inferred← citeshttps://doi.org/10.1109/tpds.2003.1214316openalex-snapshot
Efficient data parallel algorithms for multidimensional array operations based on the ekmr scheme for distributed memory multicomputers
inferred← citeshttps://doi.org/10.1111/cgf.14080openalex-snapshot
EGGS: Sparsity‐Specific Code Generation
inferred← citeshttps://doi.org/10.1137/1.9780898719918.ch13openalex-snapshot
13. Implementing Sparse Matrices for Graph Algorithms
inferred← citeshttps://doi.org/10.1145/1863543.1863581openalex-snapshot
Specifying and verifying sparse matrix codes
inferred← citeshttps://doi.org/10.1145/1993316.1993504openalex-snapshot
Data representation synthesis
inferred← citeshttps://doi.org/10.1145/263580.263630openalex-snapshot
Sparse code generation for imperfectly nested loops with dependences
inferred← citeshttps://doi.org/10.1145/2737924.2738003openalex-snapshot
Loop and data transformations for sparse matrix code
inferred← citeshttps://doi.org/10.1145/3133901openalex-snapshot
The tensor algebra compiler
inferred← citeshttps://doi.org/10.1145/3276493openalex-snapshot
Format abstraction for sparse tensor algebra compilers
inferred← citeshttps://doi.org/10.1145/335231.335240openalex-snapshot
Next-generation generic programming and its application to sparse matrix computations
inferred← citeshttps://doi.org/10.1145/3385412.3385963openalex-snapshot
Automatic generation of efficient sparse tensor format conversion routines
inferred← citeshttps://doi.org/10.1145/3410463.3414636openalex-snapshot
A Methodology for Principled Approximation in Visual SLAM
inferred← citeshttps://doi.org/10.1145/3428226openalex-snapshot
A sparse iteration space transformation framework for sparse tensor algebra
inferred← citeshttps://doi.org/10.1145/3485505openalex-snapshot
Compilation of sparse array programming models
inferred← citeshttps://doi.org/10.1145/3519939.3523442openalex-snapshot
Autoscheduling for sparse tensor algebra with an asymptotic cost model
inferred← citeshttps://doi.org/10.1145/3520484openalex-snapshot
Sparsity-Specific Code Optimization using Expression Trees
inferred← citeshttps://doi.org/10.1145/3544559openalex-snapshot
Compiler Support for Sparse Tensor Computations in MLIR
inferred← citeshttps://doi.org/10.1145/3566054openalex-snapshot
Polyhedral Specification and Code Generation of Sparse Tensor Contraction with Co-iteration
inferred← citeshttps://doi.org/10.1145/3579990.3580020openalex-snapshot
Looplets: A Language for Structured Coiteration
inferred← citeshttps://doi.org/10.1145/3656426openalex-snapshot
Compilation of Modular and General Sparse Workspaces
inferred← citeshttps://doi.org/10.1145/3689721openalex-snapshot
Compiler Support for Sparse Tensor Convolutions
inferred← citeshttps://doi.org/10.1145/3696443.3708918openalex-snapshot
Stardust: Compiling Sparse Tensor Algebra to a Reconfigurable Dataflow Architecture
inferred← citeshttps://doi.org/10.1145/3720473openalex-snapshot
Finch: Sparse and Structured Tensor Programming with Control Flow
inferred← citeshttps://doi.org/10.1145/3731599.3767477openalex-snapshot
ASaP: Automatic Software Prefetching for Sparse Tensor Computations in MLIR
inferred← citeshttps://doi.org/10.1177/1094342003017002002openalex-snapshot
Self-Adapting Numerical Software for Next Generation Applications
inferred← citeshttps://doi.org/10.14778/3407790.3407799openalex-snapshot
SPORES
inferred← citeshttps://doi.org/10.14778/3551793.3551833openalex-snapshot
Query processing on tensor computation runtimes
inferred← citeshttps://doi.org/10.26053/0h-n2q9-he00openalex-snapshot
An integrated compiler and runtime framework for sparse matrix codes
inferred← citeshttps://doi.org/10.48550/arxiv.1802.10574openalex-snapshot
Sparse Tensor Algebra Optimizations with Workspaces
inferred← citeshttps://doi.org/10.48550/arxiv.2001.00532openalex-snapshot
A Unified Iteration Space Transformation Framework for Sparse and Dense Tensor Algebra
inferred← citeshttps://doi.org/10.48550/arxiv.2112.01394openalex-snapshot
Dynamic Sparse Tensor Algebra Compilation
inferred← citeshttps://doi.org/10.5555/3018843.3018849openalex-snapshot
Compiler transformation to generate hybrid sparse computations
inferred← citeshttps://doi.org/10.5555/370049.370476openalex-snapshot
A Framework for Sparse Matrix Code Synthesis from High-level Specifications
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.