On the public citation graph
Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication
0 signed · 135 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.1002/(sici)1096-9128(199704)9:4<255::aid-cpe250>3.0.co;2-2openalex-snapshot
SUMMA: scalable universal matrix multiplication algorithm
inferredcites →https://doi.org/10.1006/jcom.1997.0438openalex-snapshot
Rectangular Matrix Multiplication Revisited
inferredcites →https://doi.org/10.1006/jcom.1998.0476openalex-snapshot
Fast Rectangular Matrix Multiplication and Applications
inferredcites →https://doi.org/10.1007/978-3-642-14165-2_20openalex-snapshot
Resource Oblivious Sorting on Multicores
inferredcites →https://doi.org/10.1007/978-3-642-23397-5_10openalex-snapshot
Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-34862-4_2openalex-snapshot
Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication
inferredcites →https://doi.org/10.1007/978-3-642-38718-0_21openalex-snapshot
Matrix Multiplication on Multidimensional Torus Networks
inferredcites →https://doi.org/10.1007/978-3-662-03338-8openalex-snapshot
Algebraic Complexity Theory
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.1016/0020-0190(79)90113-3openalex-snapshot
O(n2.7799) complexity for n × n approximate matrix multiplication
inferredcites →https://doi.org/10.1016/0167-8191(89)90091-4openalex-snapshot
Communication efficient matrix multiplication on hypercubes
inferredcites →https://doi.org/10.1016/0304-3975(83)90054-3openalex-snapshot
On the asymptotic complexity of rectangular matrix multiplication
inferredcites →https://doi.org/10.1016/j.jpdc.2004.03.021openalex-snapshot
Communication lower bounds for distributed-memory matrix multiplication
inferredcites →https://doi.org/10.1090/s0002-9904-1949-09320-5openalex-snapshot
An inequality related to the isoperimetric inequality
inferredcites →https://doi.org/10.1109/ipdps.2007.370243openalex-snapshot
Network-Oblivious Algorithms
inferredcites →https://doi.org/10.1109/ipdps.2010.5470354openalex-snapshot
Oblivious algorithms for multicores and network of processors
inferredcites →https://doi.org/10.1109/jproc.2004.840444openalex-snapshot
Is Search Really Necessary to Generate High-Performance BLAS?
inferredcites →https://doi.org/10.1137/0120004openalex-snapshot
On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
inferredcites →https://doi.org/10.1137/0211037openalex-snapshot
Rapid Multiplication of Rectangular Matrices
inferredcites →https://doi.org/10.1137/090769156openalex-snapshot
Minimizing Communication in Numerical Linear Algebra
inferredcites →https://doi.org/10.1137/s0036144503428693openalex-snapshot
Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
inferredcites →https://doi.org/10.1145/1248377.1248394openalex-snapshot
An experimental comparison of cache-oblivious and cache-conscious programs
inferredcites →https://doi.org/10.1145/2063384.2063487openalex-snapshot
Improving communication performance in dense linear algebra via topology aware collectives
inferredcites →https://doi.org/10.1145/2312005.2312044openalex-snapshot
Communication-optimal parallel algorithm for strassen's matrix multiplication
inferredcites →https://doi.org/10.1145/266670.266679openalex-snapshot
Fast rectangular matrix multiplications and improving parallel matrix computations
inferredcites →https://doi.org/10.1147/rd.395.0575openalex-snapshot
A three-dimensional approach to parallel matrix multiplication
inferredcites →https://doi.org/10.1177/109434200001400303openalex-snapshot
A Portable Programming Interface for Performance Evaluation on Modern Processors
inferredcites →https://doi.org/10.5555/2388996.2389133openalex-snapshot
Communication-avoiding parallel strassen: implementation and performance
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/qua.25926openalex-snapshot
Domain‐specific virtual processors as a portable programming and execution model for parallel computational workloads on modern heterogeneous high‐performance computing architectures
inferred← citeshttps://doi.org/10.1007/978-3-030-78713-4_12openalex-snapshot
COSTA: Communication-Optimal Shuffle and Transpose Algorithm with Process Relabeling
inferred← citeshttps://doi.org/10.1007/978-3-030-96772-7_21openalex-snapshot
Towards Optimal Fast Matrix Multiplication on CPU-GPU Platforms
inferred← citeshttps://doi.org/10.1007/978-3-031-01960-9_1openalex-snapshot
Need for High-Performance Computing for MS-Based Omics Data Analysis
inferred← citeshttps://doi.org/10.1007/978-3-031-01960-9_3openalex-snapshot
Existing HPC Methods and the Communication Lower Bounds for Distributed-Memory Computations for Mass Spectrometry-Based Omics Data
inferred← citeshttps://doi.org/10.1007/978-3-031-30442-2_4openalex-snapshot
Infinite-Precision Inner Product and Sparse Matrix-Vector Multiplication Using Ozaki Scheme with Dot2 on Manycore Processors
inferred← citeshttps://doi.org/10.1007/978-3-031-39698-4_48openalex-snapshot
Optimizing Distributed Tensor Contractions Using Node-Aware Processor Grids
inferred← citeshttps://doi.org/10.1007/978-3-319-32152-3_3openalex-snapshot
Mathematical Approach to the Performance Evaluation of Matrix Multiply Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-52709-3_5openalex-snapshot
Energy Avoiding Matrix Multiply
inferred← citeshttps://doi.org/10.1007/978-981-15-0372-6_5openalex-snapshot
Training Data on Recursive Parallel Processors for Deep Learning
inferred← citeshttps://doi.org/10.1007/s10586-021-03287-3openalex-snapshot
S-MPEC: Sparse Matrix Multiplication Performance Estimator on a Cloud Environment
inferred← citeshttps://doi.org/10.1007/s11227-020-03444-2openalex-snapshot
Towards efficient tile low-rank GEMM computation on sunway many-core processors
inferred← citeshttps://doi.org/10.1007/s11390-023-3489-yopenalex-snapshot
Joint-Communication Optimal Matrix Multiplication with Asymmetric Memories
inferred← citeshttps://doi.org/10.1007/s42514-025-00234-1openalex-snapshot
A parallel all-pairs shortest paths algorithm for dynamic graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.06.002openalex-snapshot
A massively parallel tensor contraction framework for coupled-cluster computations
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.01.022openalex-snapshot
Fault tolerant communication-optimal 2.5D matrix multiplication
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.02.010openalex-snapshot
Cross-scale efficient tensor contractions for coupled cluster computations through multiple programming model backends
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.11.001openalex-snapshot
Communication lower-bounds for distributed-memory computations for mass spectrometry based omics data
inferred← citeshttps://doi.org/10.1017/s0962492914000038openalex-snapshot
Communication lower bounds and optimal algorithms for numerical linear algebra
inferred← citeshttps://doi.org/10.1021/acs.jpca.6b10150openalex-snapshot
Massively Parallel Implementation of Explicitly Correlated Coupled-Cluster Singles and Doubles Using TiledArray Framework
inferred← citeshttps://doi.org/10.1063/5.0144493openalex-snapshot
Sparse tensor based nuclear gradients for periodic Hartree–Fock and low-scaling correlated wave function methods in the CP2K software package: A massively parallel and GPU accelerated implementation
inferred← citeshttps://doi.org/10.1080/03610918.2015.1053926openalex-snapshot
Optimal direction Gibbs sampler for truncated multivariate normal distributions
inferred← citeshttps://doi.org/10.1109/bigdata.2015.7364023openalex-snapshot
Efficient large scale distributed matrix computation with spark
inferred← citeshttps://doi.org/10.1109/cloud.2018.00088openalex-snapshot
Distributed Matrix Multiplication Performance Estimator for Machine Learning Jobs in Cloud Computing
inferred← citeshttps://doi.org/10.1109/cluster.2019.8891024openalex-snapshot
Leveraging Task-Based Polar Decomposition Using PARSEC on Massively Parallel Systems
inferred← citeshttps://doi.org/10.1109/cluster59578.2024.00020openalex-snapshot
Uncut-GEMMs: Communication-Aware Matrix Multiplication on Multi-GPU Nodes
inferred← citeshttps://doi.org/10.1109/compsac.2015.275openalex-snapshot
Unified Programming Model and Software Framework for Big Data Machine Learning and Data Analytics
inferred← citeshttps://doi.org/10.1109/hpcc-dss-smartcity-dependsys57074.2022.00203openalex-snapshot
Aware: Adaptive Distributed Training with Computation, Communication and Position Awareness for Deep Learning Model
inferred← citeshttps://doi.org/10.1109/icppw.2016.57openalex-snapshot
OSI Standards and the Top Fallacy of Distributed Computing
inferred← citeshttps://doi.org/10.1109/icsp51882.2021.9409013openalex-snapshot
Parallel matrix multiplication algorithms in Supercomputing
inferred← citeshttps://doi.org/10.1109/ipdps.2017.104openalex-snapshot
Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations
inferred← citeshttps://doi.org/10.1109/ipdps.2017.26openalex-snapshot
Towards Highly scalable Ab Initio Molecular Dynamics (AIMD) Simulations on the Intel Knights Landing Manycore Processor
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00065openalex-snapshot
Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00059openalex-snapshot
Computation of Matrix Chain Products on Parallel Machines
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00062openalex-snapshot
Distributed-memory multi-GPU block-sparse tensor contraction for electronic structure
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.53openalex-snapshot
A Time-Cost Based Automatic Scheduling Framework for Matrix Computation on Various Distributed Computing Platforms
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.171openalex-snapshot
ExtDict: Extensible Dictionaries for Data- and Platform-Aware Large-Scale Learning
inferred← citeshttps://doi.org/10.1109/ipdpsw.2019.00017openalex-snapshot
SummaGen: Parallel Matrix-Matrix Multiplication Based on Non-rectangular Partitions for Heterogeneous HPC Platforms
inferred← citeshttps://doi.org/10.1109/isspit47144.2019.9001832openalex-snapshot
Multilevel Approaches to Fine Tune Performance of Linear Algebra Libraries
inferred← citeshttps://doi.org/10.1109/mlhpc.2016.006openalex-snapshot
Distributed Training of Deep Neural Networks: Theoretical and Practical Limits of Parallel Scalability
inferred← citeshttps://doi.org/10.1109/pact.2015.41openalex-snapshot
Communication Avoiding Algorithms: Analysis and Code Generation for Parallel Systems
inferred← citeshttps://doi.org/10.1109/samos.2014.6893215openalex-snapshot
Co-exploration of NLA kernels and specification of Compute Elements in distributed memory CGRAs
inferred← citeshttps://doi.org/10.1109/sc.companion.2012.195openalex-snapshot
Poster: Beating MKL and ScaLAPACK at Rectangular Matrix Multiplication Using the BFS/DFS Approach
inferred← citeshttps://doi.org/10.1109/sc41404.2022.00033openalex-snapshot
CA3DMM: A New Algorithm Based on a Unified View of Parallel Matrix Multiplication
inferred← citeshttps://doi.org/10.1109/scw63240.2024.00101openalex-snapshot
Performance evaluation and modelling of single-precision matrix multiplication on Cerebras CS-2
inferred← citeshttps://doi.org/10.1109/tbdata.2020.2977326openalex-snapshot
Stark: Fast and Scalable Strassen’s Matrix Multiplication Using Apache Spark
inferred← citeshttps://doi.org/10.1109/tcc.2019.2950400openalex-snapshot
MPEC: Distributed Matrix Multiplication Performance Modeling on a Scale-Out Cloud Environment for Data Mining Jobs
inferred← citeshttps://doi.org/10.1109/tkde.2017.2767592openalex-snapshot
MPI-FAUN: An MPI-Based Framework for Alternating-Updating Nonnegative Matrix Factorization
inferred← citeshttps://doi.org/10.1109/tpds.2017.2686384openalex-snapshot
Improving Execution Concurrency of Large-Scale Matrix Multiplication on Distributed Data-Parallel Platforms
inferred← citeshttps://doi.org/10.1109/tpds.2020.3019471openalex-snapshot
A Parallel Structured Divide-and-Conquer Algorithm for Symmetric Tridiagonal Eigenvalue Problems
inferred← citeshttps://doi.org/10.1109/tpds.2024.3397800openalex-snapshot
AutoDDL: Automatic Distributed Deep Learning With Near-Optimal Bandwidth Cost
inferred← citeshttps://doi.org/10.1111/cgf.13758openalex-snapshot
An Efficient Solution to Structured Optimization Problems using Recursive Matrices
inferred← citeshttps://doi.org/10.1137/20m1338599openalex-snapshot
Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions
inferred← citeshttps://doi.org/10.1137/22m1510443openalex-snapshot
Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation
inferred← citeshttps://doi.org/10.1145/2486159.2486196openalex-snapshot
Communication optimal parallel multiplication of sparse random matrices
inferred← citeshttps://doi.org/10.1145/2556647.2556660openalex-snapshot
Communication costs of Strassen's matrix multiplication
inferred← citeshttps://doi.org/10.1145/2851141.2851152openalex-snapshot
A high-performance parallel algorithm for nonnegative matrix factorization
inferred← citeshttps://doi.org/10.1145/2930660openalex-snapshot
A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization
inferred← citeshttps://doi.org/10.1145/3016078.2851152openalex-snapshot
A high-performance parallel algorithm for nonnegative matrix factorization
inferred← citeshttps://doi.org/10.1145/3087556.3087561openalex-snapshot
A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem
inferred← citeshttps://doi.org/10.1145/3155292openalex-snapshot
Partitioning Models for Scaling Parallel Sparse Matrix-Matrix Multiplication
inferred← citeshttps://doi.org/10.1145/3409964.3461796openalex-snapshot
Pebbles, Graphs, and a Pinch of Combinatorics
inferred← citeshttps://doi.org/10.1145/3447818.3461472openalex-snapshot
Distributed-memory parallel algorithms for sparse times tall-skinny-dense matrix multiplication
inferred← citeshttps://doi.org/10.1145/3472456.3472524openalex-snapshot
Communication Avoiding All-Pairs Shortest Paths Algorithm for Sparse Graphs
inferred← citeshttps://doi.org/10.1145/3472456.3473519openalex-snapshot
Efficiently Parallelizable Strassen-Based Multiplication of a Matrix by its Transpose
inferred← citeshttps://doi.org/10.1145/3519939.3523437openalex-snapshot
DISTAL: the distributed tensor algebra compiler
inferred← citeshttps://doi.org/10.1145/3539781.3539784openalex-snapshot
Communication bounds for convolutional neural networks
inferred← citeshttps://doi.org/10.1145/3558481.3591072openalex-snapshot
Parallel Memory-Independent Communication Bounds for SYRK
inferred← citeshttps://doi.org/10.1145/3558481.3591083openalex-snapshot
Multiplying 2 × 2 Sub-Blocks Using 4 Multiplications
inferred← citeshttps://doi.org/10.1145/3577193.3593733openalex-snapshot
Distributed-Memory Parallel JointNMF
inferred← citeshttps://doi.org/10.1145/3577193.3593737openalex-snapshot
Parallel Software for Million-scale Exact Kernel Regression
inferred← citeshttps://doi.org/10.1145/3626183.3659961openalex-snapshot
Fault-Tolerant Parallel Integer Multiplication
inferred← citeshttps://doi.org/10.1145/3627535.3638489openalex-snapshot
Fast Kronecker Matrix-Matrix Multiplication on GPUs
inferred← citeshttps://doi.org/10.1145/3694906.3743357openalex-snapshot
Brief Announcement: Optimality Conditions for Parallel Communication-Avoiding Matrix Multiplication with Overlapped Communication
inferred← citeshttps://doi.org/10.1145/3712285.3759783openalex-snapshot
Hypertron: Efficiently Scaling Large Models by Exploring High-Dimensional Parallelization Space
inferred← citeshttps://doi.org/10.1145/3727344openalex-snapshot
Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations
inferred← citeshttps://doi.org/10.13140/rg.2.2.35070.43842openalex-snapshot
A Multilevel Approach for the Performance Analysis of Parallel Algorithms
inferred← citeshttps://doi.org/10.1587/transinf.2015edp7065openalex-snapshot
A Cloud-Friendly Communication-Optimal Implementation for Strassen's Matrix Multiplication Algorithm
inferred← citeshttps://doi.org/10.21236/ad1004753openalex-snapshot
Dynamic Systems for Individual Tracking via Heterogeneous Information Integration and Crowd Source Distributed Simulation
inferred← citeshttps://doi.org/10.2197/ipsjjip.34.132openalex-snapshot
Single-precision Matrix Multiplication Performance on Cerebras CS-2: Evaluation and Modelling of Performance, Scalability and Energy Efficiency
inferred← citeshttps://doi.org/10.22360/springsim.2019.hpc.004openalex-snapshot
Layer Based Partition for Matrix Multiplication on Heterogeneous Mesh Networks
inferred← citeshttps://doi.org/10.23919/springsim.2019.8732900openalex-snapshot
Layer Based Partition for Matrix Multiplication on Heterogeneous Mesh Networks
inferred← citeshttps://doi.org/10.25046/aj050497openalex-snapshot
Fine Tuning the Performance of Parallel Codes
inferred← citeshttps://doi.org/10.3233/apc200058openalex-snapshot
DBCSR: A Blocked Sparse Tensor Algebra Library
inferred← citeshttps://doi.org/10.3390/a15040108openalex-snapshot
Trinity: Neural Network Adaptive Distributed Parallel Training Method Based on Reinforcement Learning
inferred← citeshttps://doi.org/10.3929/ethz-a-010350411openalex-snapshot
Communication Lower Bounds for Tensor Contraction Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1404.3318openalex-snapshot
Network-Oblivious Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1504.05046openalex-snapshot
Task-Based Algorithm for Matrix Multiplication: A Step Towards Block-Sparse Tensor Computing
inferred← citeshttps://doi.org/10.48550/arxiv.1512.00066openalex-snapshot
Sparse Tensor Algebra as a Parallel Programming Model
inferred← citeshttps://doi.org/10.48550/arxiv.1708.08976openalex-snapshot
Shared Memory Parallelization of MTTKRP for Dense Tensors
inferred← citeshttps://doi.org/10.48550/arxiv.1809.09330openalex-snapshot
Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming and Linear Algebra
inferred← citeshttps://doi.org/10.48550/arxiv.1811.02084openalex-snapshot
Mesh-TensorFlow: Deep Learning for Supercomputers
inferred← citeshttps://doi.org/10.48550/arxiv.1812.06329openalex-snapshot
Layer Based Partition for Matrix Multiplication on Heterogeneous Processor Platforms
inferred← citeshttps://doi.org/10.48550/arxiv.1908.09606openalex-snapshot
Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication
inferred← citeshttps://doi.org/10.48550/arxiv.1910.13555openalex-snapshot
DBCSR: A Blocked Sparse Tensor Algebra Library
inferred← citeshttps://doi.org/10.48550/arxiv.2110.13042openalex-snapshot
Efficiently Parallelizable Strassen-Based Multiplication of a Matrix by its Transpose
inferred← citeshttps://doi.org/10.58088/8s9e-v269openalex-snapshot
Towards co-designed energy efficient computing and runtimes: simulation-framework and experiments
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.