On the public citation graph
The generalized matrix chain algorithm
0 signed · 55 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.1006/jagm.1996.0037openalex-snapshot
Very Fast Approximation of the Matrix Chain Product Problem
inferredcites →https://doi.org/10.1007/3-540-53904-2_107openalex-snapshot
Left-to-right tree pattern matching
inferredcites →https://doi.org/10.1007/978-3-319-17353-5_21openalex-snapshot
A Study on the Influence of Caching: Sequences of Dense Linear Algebra Kernels
inferredcites →https://doi.org/10.1007/978-3-642-23568-9_12openalex-snapshot
Knowledge-Based Automatic Generation of Partitioned Matrix Expressions
inferredcites →https://doi.org/10.1007/978-3-642-38718-0_33openalex-snapshot
A Domain-Specific Compiler for Linear Algebra Operations
inferredcites →https://doi.org/10.1007/bf00881866openalex-snapshot
Flatterms, discrimination nets, and fast term rewriting
inferredcites →https://doi.org/10.1007/bf02140776openalex-snapshot
The design of a parallel dense linear algebra software library: Reduction to Hessenberg, tridiagonal, and bidiagonal form
inferredcites →https://doi.org/10.1007/bfb0027016openalex-snapshot
Optimal left-to-right pattern-matching automata
inferredcites →https://doi.org/10.1016/j.laa.2015.04.008openalex-snapshot
Some matrix nearness problems suggested by Tikhonov regularization
inferredcites →https://doi.org/10.1016/j.sigpro.2015.09.017openalex-snapshot
Sparsity-based correction of exponential artifacts
inferredcites →https://doi.org/10.1109/3dv.2016.53openalex-snapshot
Consistent Discretization and Minimization of the L1 Norm on Manifolds
inferredcites →https://doi.org/10.1109/iccsa.2011.41openalex-snapshot
Automatic Generation of Loop-Invariants for Matrix Operations
inferredcites →https://doi.org/10.1109/icnc.2011.62openalex-snapshot
Accelerating the Dynamic Programming for the Matrix Chain Product on the GPU
inferredcites →https://doi.org/10.1109/ipdps.2008.4536183openalex-snapshot
Build to order linear algebra kernels
inferredcites →https://doi.org/10.1109/sc.companion.2012.60openalex-snapshot
Performance Modeling for Dense Linear Algebra
inferredcites →https://doi.org/10.1109/soac.1990.82144openalex-snapshot
Parallelization of the dynamic programming algorithm for the matrix chain product on a hypercube
inferredcites →https://doi.org/10.1109/tpds.2003.1195411openalex-snapshot
Processor allocation and task scheduling of matrix chain products on parallel systems
inferredcites →https://doi.org/10.1109/tpwrs.2016.2589464openalex-snapshot
A Dual Method for Computing Power Transfer Distribution Factors
inferredcites →https://doi.org/10.1109/tvt.2015.2506981openalex-snapshot
Robust Successive Compute-and-Forward Over Multiuser Multirelay Networks
inferredcites →https://doi.org/10.1137/0211028openalex-snapshot
Computation of Matrix Chain Products. Part I
inferredcites →https://doi.org/10.1137/0213017openalex-snapshot
Computation of Matrix Chain Products. Part II
inferredcites →https://doi.org/10.1137/0225039openalex-snapshot
An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem
inferredcites →https://doi.org/10.1137/0613049openalex-snapshot
How Fast are Nonsymmetric Matrix Iterations?
inferredcites →https://doi.org/10.1137/110830125openalex-snapshot
Expression Templates Revisited: A Performance Analysis of Current Methodologies
inferredcites →https://doi.org/10.1137/15m1045910openalex-snapshot
Robust Data Assimilation Using $L_1$ and Huber Norms
inferredcites →https://doi.org/10.1137/s0097539794270698openalex-snapshot
Efficient Matrix Chain Ordering in Polylog Time
inferredcites →https://doi.org/10.1145/1377603.1377606openalex-snapshot
Families of algorithms related to the inversion of a Symmetric Positive Definite matrix
inferredcites →https://doi.org/10.1145/2544137.2544155openalex-snapshot
A Basic Linear Algebra Compiler
inferredcites →https://doi.org/10.1145/2840728.2840762openalex-snapshot
On a Natural Dynamics for Linear Programming
inferredcites →https://doi.org/10.1145/2854038.2854060openalex-snapshot
A basic linear algebra compiler for structured matrices
inferredcites →https://doi.org/10.1145/2984043.2998539openalex-snapshot
A compiler for linear algebra operations
inferredcites →https://doi.org/10.1145/355841.355847openalex-snapshot
Basic Linear Algebra Subprograms for Fortran Usage
inferredcites →https://doi.org/10.1145/359545.359556openalex-snapshot
An O(n) algorithm for determining a near-optimal computation order of matrix chain products
inferredcites →https://doi.org/10.1145/42288.42291openalex-snapshot
An extended set of FORTRAN basic linear algebra subprograms
inferredcites →https://doi.org/10.1145/50063.356256openalex-snapshot
Corrigenda: “An Extended Set of FORTRAN Basic Linear Algebra Subprograms”
inferredcites →https://doi.org/10.1145/77626.79170openalex-snapshot
A set of level 3 basic linear algebra subprograms
inferredcites →https://doi.org/10.1177/1094342013494428openalex-snapshot
Application-tailored linear algebra algorithms
inferredcites →https://doi.org/10.1177/1094342018763042openalex-snapshot
The ELAPS framework: Experimental Linear Algebra Performance Studies
inferredcites →https://doi.org/10.4230/lipics.ecoop.2017.4openalex-snapshot
Julia: A Fast Dynamic Language for Technical Computing
inferredcites →https://doi.org/10.48550/arxiv.1408.0196openalex-snapshot
A Blind Adaptive CDMA Receiver Based on State Space Structures
inferredcites →https://doi.org/10.48550/arxiv.1606.00807openalex-snapshot
A Parallel Implementation of the Ensemble Kalman Filter Based on Modified Cholesky Decomposition
inferredcites →https://doi.org/10.48550/arxiv.1705.00907openalex-snapshot
Non-linear Associative-Commutative Many-to-One Pattern Matching with Sequence Variables
inferredcites →https://doi.org/10.48550/arxiv.1710.04286openalex-snapshot
Deriving Correct High-Performance 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/s10878-025-01290-7openalex-snapshot
On the parenthesisations of matrix chains: All are useful, few are essential
inferred← citeshttps://doi.org/10.1109/cgo68049.2026.11395236openalex-snapshot
Compilation of Generalized Matrix Chains with Symbolic Sizes
inferred← citeshttps://doi.org/10.1145/3394277.3401836openalex-snapshot
Automatic Generation of Efficient Linear Algebra Programs
inferred← citeshttps://doi.org/10.1145/3549935openalex-snapshot
The Linear Algebra Mapping Problem. Current State of Linear Algebra Languages and Libraries
inferred← citeshttps://doi.org/10.1145/3654959openalex-snapshot
On Efficient Large Sparse Matrix Chain Multiplication
inferred← citeshttps://doi.org/10.1145/3721145.3730427openalex-snapshot
Loop Fusion in Matrix Multiplications with Sparse Dependence
inferred← citeshttps://doi.org/10.1145/3725241openalex-snapshot
Output-Optimal Algorithms for Join-Aggregate Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1912.12924openalex-snapshot
Linnea: Automatic Generation of Efficient Linear Algebra Programs
inferred← citeshttps://doi.org/10.7717/peerj-cs.395openalex-snapshot
Optimal sequence for chain matrix multiplication using evolutionary algorithm
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.