On the public citation graph

An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem

0 signed · 22 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.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1016/0304-3975(88)90147-8openalex-snapshot
On efficient parallel computations for some dynamic programming problems
inferredcites →https://doi.org/10.1109/sfcs.1978.1openalex-snapshot
A data structure for orthogonal range queries
inferredcites →https://doi.org/10.1137/0204030openalex-snapshot
Parallelism in Comparison Problems
inferredcites →https://doi.org/10.1137/0211028openalex-snapshot
Computation of Matrix Chain Products. Part I
inferredcites →https://doi.org/10.1137/0212043openalex-snapshot
Fast Parallel Computation of Polynomials Using Few Processors
inferredcites →https://doi.org/10.1137/0213017openalex-snapshot
Computation of Matrix Chain Products. Part II
inferredcites →https://doi.org/10.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferredcites →https://doi.org/10.1137/0217049openalex-snapshot
Parallel Merge Sort
inferredcites →https://doi.org/10.1137/s0097539790190077openalex-snapshot
A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem
inferredcites →https://doi.org/10.1145/322217.322232openalex-snapshot
Parallel Prefix Computation

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118659199.ch9openalex-snapshot
Dynamic Programming for Energy Minimization
inferred← citeshttps://doi.org/10.1002/cpe.6445openalex-snapshot
A fast sequential algorithm for the matrix chain ordering 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/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.1137/18m1195401openalex-snapshot
Revisiting “Computation of Matrix Chain Products''
inferred← citeshttps://doi.org/10.1137/s0097539794270698openalex-snapshot
Efficient Matrix Chain Ordering in Polylog Time
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.1504/ijhpcn.2014.062729openalex-snapshot
Parallel dynamic programming for solving the optimal search binary tree problem on CGM
inferred← citeshttps://doi.org/10.48550/arxiv.2104.01777openalex-snapshot
Matrix Chain Multiplication and Polygon Triangulation Revisited and Generalized
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.