On the public citation graph
Memory-Efficient Matrix Multiplication in the BSP Model
0 signed · 91 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.1006/jpdc.1996.0051openalex-snapshot
A Framework for Generating Distributed-Memory Parallel Programs for Block Recursive Algorithms
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1007/bfb0024766openalex-snapshot
Theory, practice, and a tool for BSP performance prediction
inferredcites →https://doi.org/10.1016/0304-3975(90)90188-nopenalex-snapshot
Communication complexity of PRAMs
inferredcites →https://doi.org/10.1016/s0304-3975(97)00197-7openalex-snapshot
The bulk-synchronous parallel random access machine
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1137/0120004openalex-snapshot
On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
inferredcites →https://doi.org/10.1145/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation
inferredcites →https://doi.org/10.1147/rd.395.0575openalex-snapshot
A three-dimensional approach to parallel matrix multiplication
inferredcites →https://doi.org/10.1155/1995/636457openalex-snapshot
A Tensor Product Formulation of Strassen′s Matrix Multiplication Algorithm with Memory Reduction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-27705-6_1openalex-snapshot
Changing Challenges for Collaborative Algorithmics
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_2openalex-snapshot
BSP Algorithms — “Write Once, Run Anywhere”
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-031-43943-8_4openalex-snapshot
Stragglers in Distributed Matrix Multiplication
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-82697-9_18openalex-snapshot
DAG Scheduling in the BSP Model
inferred← citeshttps://doi.org/10.1007/978-3-031-91736-3_7openalex-snapshot
Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-Offs
inferred← citeshttps://doi.org/10.1007/978-3-540-30566-8_29openalex-snapshot
Algorithmic-Parameter Optimization of a Parallelized Split-Step Fourier Transform Using a Modified BSP Cost Model
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_2openalex-snapshot
A Bridging Model for Multi-core Computing
inferred← citeshttps://doi.org/10.1007/978-3-642-14866-8_5openalex-snapshot
Chapter 5. Realistic Computer Models
inferred← citeshttps://doi.org/10.1007/978-3-642-15291-7_36openalex-snapshot
Parallel Selection by Regular Sampling
inferred← citeshttps://doi.org/10.1007/978-3-642-23397-5_10openalex-snapshot
Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization 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/s11704-007-0016-1openalex-snapshot
Models of parallel computation: a survey and classification
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.06.012openalex-snapshot
A bridging model for multi-core computing
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.03.021openalex-snapshot
Communication lower bounds for distributed-memory matrix multiplication
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/s0167-8191(02)00160-6openalex-snapshot
Portable and architecture independent parallel performance tuning using BSP
inferred← citeshttps://doi.org/10.1017/9781009070218.003openalex-snapshot
Mathematics, Models and Architectures
inferred← citeshttps://doi.org/10.1017/s0962492914000038openalex-snapshot
Communication lower bounds and optimal algorithms for numerical linear algebra
inferred← citeshttps://doi.org/10.1093/oso/9780198788348.001.0001openalex-snapshot
Parallel Scientific Computation
inferred← citeshttps://doi.org/10.1093/oso/9780198788348.003.0003openalex-snapshot
The fast Fourier transform
inferred← citeshttps://doi.org/10.1093/oso/9780198788348.003.0004openalex-snapshot
Sparse matrix–vector multiplication
inferred← citeshttps://doi.org/10.1093/oso/9780198788348.005.0001openalex-snapshot
Auxiliary BSPedupack functions
inferred← citeshttps://doi.org/10.1093/oso/9780198788348.005.0002openalex-snapshot
A quick reference guide to BSPlib
inferred← citeshttps://doi.org/10.1109/12.936231openalex-snapshot
Matrix multiplication on the OTIS-Mesh optoelectronic computer
inferred← citeshttps://doi.org/10.1109/bigdata.2015.7364023openalex-snapshot
Efficient large scale distributed matrix computation with spark
inferred← citeshttps://doi.org/10.1109/comhpc.2016.010openalex-snapshot
Network Topologies and Inevitable Contention
inferred← citeshttps://doi.org/10.1109/hpcsim.2013.6641452openalex-snapshot
Model-guided performance analysis of the sparse matrix-matrix multiplication
inferred← citeshttps://doi.org/10.1109/ipdps.2013.80openalex-snapshot
Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication
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.2019.00020openalex-snapshot
Communication-Avoiding Cholesky-QR2 for Rectangular Matrices
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00059openalex-snapshot
Computation of Matrix Chain Products on Parallel Machines
inferred← citeshttps://doi.org/10.1109/ipdps57955.2024.00013openalex-snapshot
Alternative Basis Matrix Multiplication is Fast and Stable
inferred← citeshttps://doi.org/10.1109/ipdpsw63119.2024.00195openalex-snapshot
Efficient Multi-Processor Scheduling in Increasingly Realistic Models (Brief Summary)
inferred← citeshttps://doi.org/10.1109/sc.2012.33openalex-snapshot
Communication-Avoiding Parallel Strassen: Implementation and performance
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/tpds.2017.2686384openalex-snapshot
Improving Execution Concurrency of Large-Scale Matrix Multiplication on Distributed Data-Parallel Platforms
inferred← citeshttps://doi.org/10.1137/090769156openalex-snapshot
Minimizing Communication in Numerical Linear Algebra
inferred← citeshttps://doi.org/10.1137/140993478openalex-snapshot
Parallel Matrix Multiplication: A Systematic Journey
inferred← citeshttps://doi.org/10.1137/22m1502719openalex-snapshot
Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
inferred← citeshttps://doi.org/10.1142/s0129626403001318openalex-snapshot
BSPGRID: VARIABLE RESOURCES PARALLEL COMPUTATION AND MULTIPROGRAMMED PARALLELISM
inferred← citeshttps://doi.org/10.1142/s0129626408003193openalex-snapshot
EXPERIMENTAL EVALUATION OF BSP PROGRAMMING LIBRARIES
inferred← citeshttps://doi.org/10.1145/2304576.2304607openalex-snapshot
Space-round tradeoffs for MapReduce computations
inferred← citeshttps://doi.org/10.1145/2395116.2395121openalex-snapshot
Graph expansion and communication costs of fast matrix multiplication
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/2612669.2612671openalex-snapshot
Tradeoffs between synchronization, communication, and computation in parallel linear algebra computations
inferred← citeshttps://doi.org/10.1145/2897188openalex-snapshot
Trade-Offs Between Synchronization, Communication, and Computation in Parallel Linear Algebra Computations
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/3093172.3093228openalex-snapshot
Increasing the Efficiency of Sparse Matrix-Matrix Multiplication with a 2.5D Algorithm and One-Sided MPI
inferred← citeshttps://doi.org/10.1145/3126908.3126971openalex-snapshot
Scaling betweenness centrality using communication-efficient sparse matrix multiplication
inferred← citeshttps://doi.org/10.1145/3323165.3323188openalex-snapshot
Faster Matrix Multiplication via Sparse Decomposition
inferred← citeshttps://doi.org/10.1145/3350755.3400225openalex-snapshot
Communication vs Synchronisation in Parallel String Comparison
inferred← citeshttps://doi.org/10.1145/3364504openalex-snapshot
Matrix Multiplication, a Little Faster
inferred← citeshttps://doi.org/10.1145/3409390.3409404openalex-snapshot
Improving the Space-Time Efficiency of Matrix Multiplication Algorithms
inferred← citeshttps://doi.org/10.1145/3472456.3472506openalex-snapshot
Processor-Aware Cache-Oblivious Algorithms✱
inferred← citeshttps://doi.org/10.1145/3626183.3659961openalex-snapshot
Fault-Tolerant Parallel Integer Multiplication
inferred← citeshttps://doi.org/10.1145/3626183.3659972openalex-snapshot
Efficient Multi-Processor Scheduling in Increasingly Realistic Models
inferred← citeshttps://doi.org/10.1145/3626183.3660269openalex-snapshot
Brief Announcement: Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
inferred← citeshttps://doi.org/10.1145/3694906.3743307openalex-snapshot
Minimizing Processor Count for Fault Tolerant Toom-Cook Algorithms
inferred← citeshttps://doi.org/10.1145/3694906.3743320openalex-snapshot
The Impact of Partial Computations on the Red-Blue Pebble Game
inferred← citeshttps://doi.org/10.1145/3727344openalex-snapshot
Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations
inferred← citeshttps://doi.org/10.1145/3749740.3749759openalex-snapshot
The Bulk-Synchronous Parallel Model
inferred← citeshttps://doi.org/10.14529/cmse190304openalex-snapshot
Survey of Parallel Computation Models
inferred← citeshttps://doi.org/10.21236/ada584726openalex-snapshot
Communication Lower Bounds and Optimal Algorithms for Programs that Reference Arrays - Part 1
inferred← citeshttps://doi.org/10.21236/ada604834openalex-snapshot
Tradeoffs Between Synchronization, Communication, and Work in Parallel Linear Algebra Computations
inferred← citeshttps://doi.org/10.21236/ada614374openalex-snapshot
Contention Bounds for Combinations of Computation Graphs and Network Topologies
inferred← citeshttps://doi.org/10.48550/arxiv.1911.05328openalex-snapshot
Improving the Space-Time Efficiency of Processor-Oblivious Matrix Multiplication Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2008.13292openalex-snapshot
Low-Depth Parallel Algorithms for the Binary-Forking Model without Atomics
inferred← citeshttps://doi.org/10.5555/2388996.2389133openalex-snapshot
Communication-avoiding parallel strassen: implementation and performance
inferred← citeshttps://doi.org/10.5555/3018058.3018063openalex-snapshot
Network topologies and inevitable contention
inferred← citeshttps://doi.org/10.82444/warw.33642601openalex-snapshot
Dynamic BSP : towards a flexible approach to parallel computing over the grid
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.