On the public citation graph

Extra High Speed Matrix Multiplication on the Cray-2

https://doi.org/10.1137/0909040
0 signed · 73 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/3-540-07854-1_206openalex-snapshot
On memory requirements of Strassen's algorithms
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1016/0167-7136(86)90017-xopenalex-snapshot
Computational complexity of sequential and parallel algorithms
inferredcites →https://doi.org/10.1137/0204009openalex-snapshot
Computational Complexity and Numerical Stability
inferredcites →https://doi.org/10.1137/0209027openalex-snapshot
New Fast Algorithms for Matrix Operations
inferredcites →https://doi.org/10.1137/0211038openalex-snapshot
On the Asymptotic Complexity of Matrix Multiplication

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1099-1506(199912)6:8<687::aid-nla177>3.0.co;2-iopenalex-snapshot
A practical algorithm for faster matrix multiplication
inferred← citeshttps://doi.org/10.1007/978-1-4612-1986-6_16openalex-snapshot
Automating the Debugging of Large Numerical Codes
inferred← citeshttps://doi.org/10.1007/978-1-4615-3958-2_9openalex-snapshot
Quadratic 0-1 Programming
inferred← citeshttps://doi.org/10.1007/978-1-4615-7416-3_2openalex-snapshot
Chemical Calculations on Cray Computers
inferred← citeshttps://doi.org/10.1007/978-3-662-10421-7_58openalex-snapshot
Perspective on “Principles for a direct SCF approach to LCAO-MO ab initio calculations”
inferred← citeshttps://doi.org/10.1007/978-94-009-0945-8_9openalex-snapshot
Computational Strategies and Improvements in the Linear Algebraic Variational Approach to Rearrangement Scattering
inferred← citeshttps://doi.org/10.1007/978-94-015-8196-7_4openalex-snapshot
Trading off Parallelism and Numerical Stability
inferred← citeshttps://doi.org/10.1007/bf00127843openalex-snapshot
Multilinear algebra and parallel programming
inferred← citeshttps://doi.org/10.1007/bf00128490openalex-snapshot
Performance comparison of the CRAY X-MP/24 with SDD and the CRAY-2
inferred← citeshttps://doi.org/10.1007/bf00129836openalex-snapshot
Using Strassen's algorithm to accelerate the solution of linear systems
inferred← citeshttps://doi.org/10.1007/bfb0030137openalex-snapshot
A transform approach to fast matrix multiplication
inferred← citeshttps://doi.org/10.1007/s002110050348openalex-snapshot
Improving and estimating the accuracy of Strassen's algorithm
inferred← citeshttps://doi.org/10.1007/s10766-015-0378-1openalex-snapshot
Optimizing the Matrix Multiplication Using Strassen and Winograd Algorithms with Limited Recursions on Many-Core
inferred← citeshttps://doi.org/10.1016/0024-3795(92)90393-oopenalex-snapshot
On practical algorithms for accelerated matrix multiplication
inferred← citeshttps://doi.org/10.1016/0024-3795(93)00230-wopenalex-snapshot
Fast rectangular matrix multiplication and QR decomposition
inferred← citeshttps://doi.org/10.1016/0898-1221(95)00077-copenalex-snapshot
Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures
inferred← citeshttps://doi.org/10.1016/j.apm.2016.03.009openalex-snapshot
An accurate fingerprint orientation modeling algorithm
inferred← citeshttps://doi.org/10.1016/j.camwa.2005.08.003openalex-snapshot
A study on quaternion blockquasi-tridiagonal systems
inferred← citeshttps://doi.org/10.1016/j.ipl.2024.106517openalex-snapshot
Improving compressed matrix multiplication using control variate method
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.07.004openalex-snapshot
On the arithmetic complexity of Strassen-like matrix multiplications
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.004openalex-snapshot
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
inferred← citeshttps://doi.org/10.1016/s0165-1684(99)00022-5openalex-snapshot
DOA and frequency estimation using fast subspace algorithms
inferred← citeshttps://doi.org/10.1023/a:1016676318988openalex-snapshot
A Fast Algorithm for Matrix Multiplication and Its Efficient Realization on Systolic Arrays
inferred← citeshttps://doi.org/10.1070/sm8833openalex-snapshot
Fast matrix multiplication and its algebraic neighbourhood
inferred← citeshttps://doi.org/10.1080/10637199408915454openalex-snapshot
FAST MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES
inferred← citeshttps://doi.org/10.1080/10637199508915488openalex-snapshot
A RECURRENCE-FREE VARIANT OF STRASSEN'S ALGORITHM ON HYPERCUBE∗
inferred← citeshttps://doi.org/10.1109/78.875461openalex-snapshot
Rational invariant subspace approximations with applications
inferred← citeshttps://doi.org/10.1109/acit58437.2023.10275419openalex-snapshot
A Perusal of Algrebraic and Computational Modelling on Matrix Multiplication Time Complexity
inferred← citeshttps://doi.org/10.1109/cloudcom.2012.6427556openalex-snapshot
Design fast matrix algorithms on high-performance cloud platforms
inferred← citeshttps://doi.org/10.1109/fmpc.1995.380460openalex-snapshot
MICA: a mapped interconnection-cached architecture
inferred← citeshttps://doi.org/10.1109/hipc.2013.6799109openalex-snapshot
Accelerating Strassen-Winograd's matrix multiplication algorithm on GPUs
inferred← citeshttps://doi.org/10.1109/hpc.1997.592177openalex-snapshot
Matrix multiplications on the memory based processor array
inferred← citeshttps://doi.org/10.1109/icassp.1999.756269openalex-snapshot
Rational signal subspace approximation with applications to DOA estimation
inferred← citeshttps://doi.org/10.1109/ipps.1993.262814openalex-snapshot
A tensor product formulation of Strassen's matrix multiplication algorithm with memory reduction
inferred← citeshttps://doi.org/10.1109/sc.1998.10045openalex-snapshot
Tuning Strassen's Matrix Multiplication for Memory Efficiency
inferred← citeshttps://doi.org/10.1109/snpd.2015.7176172openalex-snapshot
Optimizing strassen matrix multiply on GPUs
inferred← citeshttps://doi.org/10.1109/superc.1988.44680openalex-snapshot
A Strassen-Newton algorithm for high-speed parallelizable matrix inversion
inferred← citeshttps://doi.org/10.1109/superc.1990.129997openalex-snapshot
Multilinear algebra and parallel programming
inferred← citeshttps://doi.org/10.1109/tit.2008.926346openalex-snapshot
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.1137/0613026openalex-snapshot
Efficient Matrix Multiplication on SIMD Computers
inferred← citeshttps://doi.org/10.1137/0613043openalex-snapshot
Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications
inferred← citeshttps://doi.org/10.1137/0911038openalex-snapshot
Fast Polar Decomposition of an Arbitrary Matrix
inferred← citeshttps://doi.org/10.1137/0914008openalex-snapshot
Reducing the Symmetric Matrix Eigenvalue Problem to Matrix Multiplications
inferred← citeshttps://doi.org/10.1137/1032002openalex-snapshot
Parallel Algorithms for Dense Linear Algebra Computations
inferred← citeshttps://doi.org/10.1137/22m1502719openalex-snapshot
Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
inferred← citeshttps://doi.org/10.1145/1576702.1576713openalex-snapshot
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
inferred← citeshttps://doi.org/10.1145/1989493.1989495openalex-snapshot
Graph expansion and communication costs of fast matrix multiplication
inferred← citeshttps://doi.org/10.1145/2395116.2395121openalex-snapshot
Graph expansion and communication costs of fast matrix multiplication
inferred← citeshttps://doi.org/10.1145/2688500.2688513openalex-snapshot
A framework for practical parallel fast matrix multiplication
inferred← citeshttps://doi.org/10.1145/2858788.2688513openalex-snapshot
A framework for practical parallel fast matrix multiplication
inferred← citeshttps://doi.org/10.1145/369028.369096openalex-snapshot
Implementation of Strassen's algorithm for matrix multiplication
inferred← citeshttps://doi.org/10.1145/505241.505242openalex-snapshot
Fast context-free grammar parsing requires fast boolean matrix multiplication
inferred← citeshttps://doi.org/10.1145/98267.98290openalex-snapshot
Exploiting fast matrix multiplication within the level 3 BLAS
inferred← citeshttps://doi.org/10.1147/rd.395.0575openalex-snapshot
A three-dimensional approach to parallel matrix multiplication
inferred← citeshttps://doi.org/10.1155/1992/328793openalex-snapshot
Misleading Performance Reporting in the Supercomputing Field
inferred← citeshttps://doi.org/10.1155/1995/636457openalex-snapshot
A Tensor Product Formulation of Strassen′s Matrix Multiplication Algorithm with Memory Reduction
inferred← citeshttps://doi.org/10.1175/mwr2819.1openalex-snapshot
Optimization of a Direct Elliptic Boundary Value Problem Solver by the Combined Use of Symmetry and Strassen's Algorithm
inferred← citeshttps://doi.org/10.2312/egmm/mm04/115-123openalex-snapshot
Progressive Image Transmission Using Singular Value Decomposition
inferred← citeshttps://doi.org/10.4213/sm8833openalex-snapshot
Быстрое умножение матриц и смежные вопросы алгебры
inferred← citeshttps://doi.org/10.48550/arxiv.0707.2347openalex-snapshot
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1007.2117openalex-snapshot
Strassen's Matrix Multiplication Algorithm for Matrices of Arbitrary Order
inferred← citeshttps://doi.org/10.48550/arxiv.1412.1145openalex-snapshot
Matrix Multiplication, Trilinear Decompositions, APA Algorithms, and Summation
inferred← citeshttps://doi.org/10.48550/arxiv.1612.05766openalex-snapshot
Fast Matrix Multiplication and Symbolic Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1804.04102openalex-snapshot
Fast Feasible and Unfeasible Matrix Multiplication
inferred← citeshttps://doi.org/10.5555/110382.110390openalex-snapshot
Multilinear algebra and parallel programming
inferred← citeshttps://doi.org/10.5555/509058.509094openalex-snapshot
Tuning Strassen's Matrix Multiplication for Memory Efficiency
inferred← citeshttps://doi.org/10.5555/62972.63025openalex-snapshot
A Strassen-Newton algorithm for high-speed parallelizable matrix inversion
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.