On the public citation graph

Matrix Multiplication, a Little Faster

https://doi.org/10.1145/3364504
0 signed · 77 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.1002/(sici)1099-1506(199912)6:8<687::aid-nla177>3.0.co;2-iopenalex-snapshot
A practical algorithm for faster matrix multiplication
inferredcites →https://doi.org/10.1007/11830924openalex-snapshot
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
inferredcites →https://doi.org/10.1007/3-540-06841-4_78openalex-snapshot
Efficient Procedures for Using Matrix Algorithms
inferredcites →https://doi.org/10.1007/978-3-319-62127-2_16openalex-snapshot
The I/O Complexity of Strassen’s Matrix Multiplication with Recomputation
inferredcites →https://doi.org/10.1007/bf01395989openalex-snapshot
Stability of fast algorithms for matrix multiplication
inferredcites →https://doi.org/10.1007/bf01580890openalex-snapshot
A hierarchical algorithm for making sparse matrices sparser
inferredcites →https://doi.org/10.1007/bf01588780openalex-snapshot
Making sparse matrices sparser: Computational results
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1007/pl00008264openalex-snapshot
Memory-Efficient Matrix Multiplication in the BSP Model
inferredcites →https://doi.org/10.1007/s00211-007-0061-6openalex-snapshot
Fast matrix multiplication is stable
inferredcites →https://doi.org/10.1007/s00211-007-0114-xopenalex-snapshot
Fast linear algebra is stable
inferredcites →https://doi.org/10.1007/s002110050348openalex-snapshot
Improving and estimating the accuracy of Strassen's algorithm
inferredcites →https://doi.org/10.1016/0020-0190(79)90113-3openalex-snapshot
O(n2.7799) complexity for n × n approximate matrix multiplication
inferredcites →https://doi.org/10.1016/0020-0190(95)00176-xopenalex-snapshot
On the additive complexity of 2 × 2 matrix multiplication
inferredcites →https://doi.org/10.1016/0024-3795(71)90009-7openalex-snapshot
On multiplication of 2 × 2 matrices
inferredcites →https://doi.org/10.1016/0024-3795(92)90393-oopenalex-snapshot
On practical algorithms for accelerated matrix multiplication
inferredcites →https://doi.org/10.1016/0898-1221(82)90037-2openalex-snapshot
Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
inferredcites →https://doi.org/10.1016/b978-0-12-566780-7.50017-9openalex-snapshot
A Fast Algorithm that makes Matrices Optimally Sparse
inferredcites →https://doi.org/10.1016/j.jsc.2016.07.004openalex-snapshot
On the arithmetic complexity of Strassen-like matrix multiplications
inferredcites →https://doi.org/10.1016/j.tcs.2004.01.004openalex-snapshot
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1090/s0025-5718-1965-0178586-1openalex-snapshot
An Algorithm for the Machine Calculation of Complex Fourier Series
inferredcites →https://doi.org/10.1109/sc.2012.33openalex-snapshot
Communication-Avoiding Parallel Strassen: Implementation and performance
inferredcites →https://doi.org/10.1109/sfcs.1978.34openalex-snapshot
Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations
inferredcites →https://doi.org/10.1109/sfcs.1986.52openalex-snapshot
The asymptotic spectrum of tensors and the exponent of matrix multiplication
inferredcites →https://doi.org/10.1109/tit.2008.926346openalex-snapshot
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication
inferredcites →https://doi.org/10.1134/s0965542513120129openalex-snapshot
The bilinear complexity and practical algorithms for matrix multiplication
inferredcites →https://doi.org/10.1137/0120004openalex-snapshot
On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
inferredcites →https://doi.org/10.1137/0205016openalex-snapshot
On the Additive Complexity of Matrix Multiplication
inferredcites →https://doi.org/10.1137/0210032openalex-snapshot
Partial and Total Matrix Multiplication
inferredcites →https://doi.org/10.1137/0211020openalex-snapshot
Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
inferredcites →https://doi.org/10.1137/0211038openalex-snapshot
On the Asymptotic Complexity of Matrix Multiplication
inferredcites →https://doi.org/10.1137/0215043openalex-snapshot
Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication
inferredcites →https://doi.org/10.1137/050638369openalex-snapshot
On the Computation of Null Spaces of Sparse Rectangular Matrices
inferredcites →https://doi.org/10.1137/090769156openalex-snapshot
Minimizing Communication in Numerical Linear Algebra
inferredcites →https://doi.org/10.1137/1.9780898718027openalex-snapshot
Accuracy and Stability of Numerical Algorithms
inferredcites →https://doi.org/10.1137/15m1032168openalex-snapshot
Improving the Numerical Stability of Fast Matrix Multiplication
inferredcites →https://doi.org/10.1142/s0129626496000029openalex-snapshot
A HIGH PERFORMANCE PARALLEL STRASSEN IMPLEMENTATION
inferredcites →https://doi.org/10.1145/1837934.1837987openalex-snapshot
A Strassen-like matrix multiplication suited for squaring and higher power computation
inferredcites →https://doi.org/10.1145/2049662.2049664openalex-snapshot
Exploiting parallelism in matrix-computation kernels for symmetric multiprocessor systems
inferredcites →https://doi.org/10.1145/2213977.2214056openalex-snapshot
Multiplying matrices faster than coppersmith-winograd
inferredcites →https://doi.org/10.1145/2312005.2312044openalex-snapshot
Communication-optimal parallel algorithm for strassen's matrix multiplication
inferredcites →https://doi.org/10.1145/2395116.2395121openalex-snapshot
Graph expansion and communication costs of fast matrix multiplication
inferredcites →https://doi.org/10.1145/2508028.2505989openalex-snapshot
Matrix sparsification and nested dissection over arbitrary fields
inferredcites →https://doi.org/10.1145/2608628.2608664openalex-snapshot
Powers of tensors and fast matrix multiplication
inferredcites →https://doi.org/10.1145/2755573.2755594openalex-snapshot
Matrix Multiplication I/O-Complexity by Path Routing
inferredcites →https://doi.org/10.1145/2858788.2688513openalex-snapshot
A framework for practical parallel fast matrix multiplication
inferredcites →https://doi.org/10.1145/3087556.3087579openalex-snapshot
Matrix Multiplication, a Little Faster
inferredcites →https://doi.org/10.1145/3323165.3323188openalex-snapshot
Faster Matrix Multiplication via Sparse Decomposition
inferredcites →https://doi.org/10.1155/1995/636457openalex-snapshot
A Tensor Product Formulation of Strassen′s Matrix Multiplication Algorithm with Memory Reduction
inferredcites →https://doi.org/10.1287/ijoc.1.2.84openalex-snapshot
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
inferredcites →https://doi.org/10.5555/1064364.1064367openalex-snapshot
Impact of mixed-parallelism on parallel implementations of the Strassen and Winograd matrix multiplication algorithms
inferredcites →https://doi.org/10.5860/choice.34-0981openalex-snapshot
Accuracy and stability of numerical algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4861163openalex-extracted
A Multilinear Generalization of Yates's Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_24openalex-snapshot
Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues
inferred← citeshttps://doi.org/10.1007/978-3-031-66336-9_14openalex-snapshot
MathPartner: An Artificial Intelligence Cloud Service
inferred← citeshttps://doi.org/10.1007/978-3-031-69583-4_5openalex-snapshot
Minimizing I/O in Toom-Cook Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-032-35251-4_37openalex-snapshot
Minimizing Communication Costs in Inner Product Toom-Cook Algorithms
inferred← citeshttps://doi.org/10.1007/s00211-026-01531-9openalex-snapshot
Alternative Basis matrix multiplication is fast and stable†
inferred← citeshttps://doi.org/10.1007/s00453-024-01247-yopenalex-snapshot
Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication
inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102523openalex-snapshot
Fast in-place accumulation
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.115022openalex-snapshot
A new fast root-finder for black box polynomials
inferred← citeshttps://doi.org/10.1109/access.2024.3446176openalex-snapshot
Quantum Subroutine for Efficient Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/ccwc57344.2023.10099141openalex-snapshot
An Efficient Parallel Divide-and-Conquer Algorithm for Generalized Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/ipdps57955.2024.00013openalex-snapshot
Alternative Basis Matrix Multiplication is Fast and Stable
inferred← citeshttps://doi.org/10.1134/s0965542524701021openalex-snapshot
Finding Complex-Valued Solutions of Brent Equations Using Nonlinear Least Squares
inferred← citeshttps://doi.org/10.1137/22m1502719openalex-snapshot
Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
inferred← citeshttps://doi.org/10.1145/3323165.3323188openalex-snapshot
Faster Matrix Multiplication via Sparse Decomposition
inferred← citeshttps://doi.org/10.1145/3558481.3591083openalex-snapshot
Multiplying 2 × 2 Sub-Blocks Using 4 Multiplications
inferred← citeshttps://doi.org/10.1145/3597066.3597099openalex-snapshot
Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
inferred← citeshttps://doi.org/10.1145/3666000.3669671openalex-snapshot
In-place accumulation of fast multiplication formulae
inferred← citeshttps://doi.org/10.1145/3771573openalex-snapshot
ObliQ: Solving Quadratic Unconstrained Binary Optimization Problems on Real Photonic Quantum Machines
inferred← citeshttps://doi.org/10.1145/3815436.3815461openalex-snapshot
Complex to Rational Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.1145/3816782.3819195openalex-snapshot
Brief Announcement: An Automatic Framework for High Performance Alternative Basis Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.1145/3832810.3832836openalex-snapshot
BAG: Faster Matrix Multiplication on a Single GPU
inferred← citeshttps://doi.org/10.26855/jamc.2021.09.004openalex-snapshot
Statistical Analysis of Amir Schoor’s Algorithm in Sequential and Parallel Environment
inferred← citeshttps://doi.org/10.48550/arxiv.2307.12712openalex-snapshot
In-place accumulation of fast multiplication formulae
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.