On the public citation graph
Computation of Matrix Chain Products. Part II
0 signed · 65 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.1109/tc.1973.5009182openalex-snapshot
On Efficient Computation of Matrix Chain Products
inferredcites →https://doi.org/10.1137/0211028openalex-snapshot
Computation of Matrix Chain Products. Part I
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.6445openalex-snapshot
A fast sequential algorithm for the matrix chain ordering problem
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_30openalex-snapshot
Parallel algorithm for the matrix chain product and the optimal triangulation problems (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_85openalex-snapshot
Lower bounds for the matrix chain ordering problem
inferred← citeshttps://doi.org/10.1007/978-1-4020-6585-9_9openalex-snapshot
Dynamic Programming via Static Incrementalization
inferred← citeshttps://doi.org/10.1007/978-3-030-63920-4_5openalex-snapshot
Matrix Chain Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-031-01869-5openalex-snapshot
Data Management in Machine Learning Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-74430-3_7openalex-snapshot
Challenges in Parallel Matrix Chain Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-031-76930-6_8openalex-snapshot
Summary of Fast Matrix Multiplication Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-91839-6_16openalex-snapshot
Matrix Chain Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-540-30561-3_28openalex-snapshot
Overlaying Multiple Maps Efficiently
inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_13openalex-snapshot
Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-19542-6_58openalex-snapshot
A Novel Approach for Matrix Chain Multiplication Using Greedy Technique for Packet Processing
inferred← citeshttps://doi.org/10.1007/978-3-642-30111-7_67openalex-snapshot
Information Security Using Chains Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/bf02591857openalex-snapshot
Triangulations (tilings) and certain block triangular matrices
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.1016/0196-6774(81)90014-6openalex-snapshot
An O(n) algorithm to find a near-optimum partition of a convex polygon
inferred← citeshttps://doi.org/10.1016/0196-6774(83)90024-xopenalex-snapshot
Multiterminal flows in outerplanar networks
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90135-3openalex-snapshot
Dynamic programming with convexity, concavity and sparsity
inferred← citeshttps://doi.org/10.1016/0898-1221(94)90123-6openalex-snapshot
Dynamic programming and graph optimization problems
inferred← citeshttps://doi.org/10.1016/0898-1221(95)00138-oopenalex-snapshot
An efficient parallel dynamic programming algorithm
inferred← citeshttps://doi.org/10.1016/j.dam.2020.04.016openalex-snapshot
Dynamic programming bi-criteria combinatorial optimization
inferred← citeshttps://doi.org/10.1051/ro/2011100openalex-snapshot
Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices
inferred← citeshttps://doi.org/10.1063/1.5128269openalex-snapshot
Material coherence from trajectories via Burau eigenanalysis of braids
inferred← citeshttps://doi.org/10.1103/physreve.90.033315openalex-snapshot
Faster identification of optimal contraction sequences for tensor networks
inferred← citeshttps://doi.org/10.1109/aiccsa.2014.7073186openalex-snapshot
Performance evaluation of a parallel dynamic programming algorithm for solving the matrix chain product problem
inferred← citeshttps://doi.org/10.1109/cgo68049.2026.11395236openalex-snapshot
Compilation of Generalized Matrix Chains with Symbolic Sizes
inferred← citeshttps://doi.org/10.1109/cicybs.2011.5949395openalex-snapshot
Addressing the need for independence in the CSE model
inferred← citeshttps://doi.org/10.1109/iccse.2013.6553999openalex-snapshot
Efficient computation of matrix chain
inferred← citeshttps://doi.org/10.1109/icecct.2017.8117870openalex-snapshot
Design and implementation of GPU-based matrix chain multiplication using C++AMP
inferred← citeshttps://doi.org/10.1109/icicas48597.2019.00176openalex-snapshot
A Sparse Matrix Fast Transpose Algorithm Based on Pseudo-Address
inferred← citeshttps://doi.org/10.1109/icnc.2011.62openalex-snapshot
Accelerating the Dynamic Programming for the Matrix Chain Product on the GPU
inferred← citeshttps://doi.org/10.1109/iicspi.2018.8690360openalex-snapshot
The Compression Storage Research for Uniform Block Diagonal Matrix
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00059openalex-snapshot
Computation of Matrix Chain Products on Parallel Machines
inferred← citeshttps://doi.org/10.1109/ipdps64566.2025.00057openalex-snapshot
SPRT2: Scalable, Parallel, and Real-Time fMRI Data Analysis on Heterogeneous Architectures
inferred← citeshttps://doi.org/10.1109/ipps.1994.288295openalex-snapshot
Efficient matrix chain ordering in polylog time
inferred← citeshttps://doi.org/10.1109/tpds.2003.1195411openalex-snapshot
Processor allocation and task scheduling of matrix chain products on parallel systems
inferred← citeshttps://doi.org/10.1109/tpds.2007.1027openalex-snapshot
Analysis of Parallel Algorithms for Matrix Chain Product and Matrix Powers on Distributed Memory Systems
inferred← citeshttps://doi.org/10.1137/0211028openalex-snapshot
Computation of Matrix Chain Products. Part I
inferred← citeshttps://doi.org/10.1137/0225039openalex-snapshot
An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem
inferred← citeshttps://doi.org/10.1137/18m1195401openalex-snapshot
Revisiting “Computation of Matrix Chain Products''
inferred← citeshttps://doi.org/10.1137/s0097539790190077openalex-snapshot
A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem
inferred← citeshttps://doi.org/10.1137/s0097539794270698openalex-snapshot
Efficient Matrix Chain Ordering in Polylog Time
inferred← citeshttps://doi.org/10.1145/1077464.1077466openalex-snapshot
Fast sparse matrix multiplication
inferred← citeshttps://doi.org/10.1145/2984043.2998539openalex-snapshot
A compiler for linear algebra operations
inferred← citeshttps://doi.org/10.1145/3168804openalex-snapshot
The generalized matrix chain algorithm
inferred← citeshttps://doi.org/10.1145/3179541.3168804openalex-snapshot
The generalized matrix chain algorithm
inferred← citeshttps://doi.org/10.14778/3137628.3137633openalex-snapshot
Towards linear algebra over normalized data
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2270199/v1openalex-snapshot
An analysis of vectorised automatic differentiation for statistical applications
inferred← citeshttps://doi.org/10.2200/s00895ed1v01y201901dtm057openalex-snapshot
Data Management in Machine Learning Systems
inferred← citeshttps://doi.org/10.3390/stats8020040openalex-snapshot
An Analysis of Vectorised Automatic Differentiation for Statistical Applications
inferred← citeshttps://doi.org/10.4018/ijghpc.2014040105openalex-snapshot
An Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering Problem
inferred← citeshttps://doi.org/10.4018/jalr.2010040106openalex-snapshot
An Optimal Balanced Partitioning of a Set of 1D Intervals
inferred← citeshttps://doi.org/10.48550/arxiv.1102.1897openalex-snapshot
Random Substitution-Insertion-Deletion (RSID) Model of Molecular Evolution with Alignment-free Parameter Estimation
inferred← citeshttps://doi.org/10.48550/arxiv.1808.03370openalex-snapshot
Fast Flexible Function Dispatch in Julia
inferred← citeshttps://doi.org/10.48550/arxiv.1912.12924openalex-snapshot
Linnea: Automatic Generation of Efficient Linear Algebra Programs
inferred← citeshttps://doi.org/10.48550/arxiv.2104.01777openalex-snapshot
Matrix Chain Multiplication and Polygon Triangulation Revisited and Generalized
inferred← citeshttps://doi.org/10.5120/9245-3408openalex-snapshot
Chain Multiplication of Dense Matrices: Proposing a Shared Memory based Parallel Algorithm
inferred← citeshttps://doi.org/10.5555/127787.127838openalex-snapshot
A new lower bound technique and its application: tight lower bound for a polygon triangulation problem
inferred← citeshttps://doi.org/10.70675/68b8abf8z57bbz41bdz8336z62acd143ee4fopenalex-snapshot
Tracking haute fréquence pour architectures SIMD : optimisation de la reconstruction LHCb
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.