On the public citation graph
Trade-Offs Between Synchronization, Communication, and Computation in Parallel Linear Algebra Computations
0 signed · 59 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/jcss.1997.1473openalex-snapshot
Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers
inferredcites →https://doi.org/10.1007/3-540-48224-5_15openalex-snapshot
All-Pairs Shortest Paths Computation in the BSP Model
inferredcites →https://doi.org/10.1007/3-540-60922-9_53openalex-snapshot
Optimal schedules for d-D grid graphs with communication delays
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-32820-6_67openalex-snapshot
A Lower Bound Technique for Communication on BSP with Application to the FFT
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/s00224-010-9285-4openalex-snapshot
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model
inferredcites →https://doi.org/10.1007/s002240000066openalex-snapshot
Processor—Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds
inferredcites →https://doi.org/10.1007/s002240000131openalex-snapshot
ProcessorTime Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds
inferredcites →https://doi.org/10.1016/0304-3975(90)90188-nopenalex-snapshot
Communication complexity of PRAMs
inferredcites →https://doi.org/10.1016/j.future.2006.04.017openalex-snapshot
Communication-efficient parallel generic pairwise elimination
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.1016/s0129-6264(02)00084-7openalex-snapshot
TRADING REPLICATION FOR COMMUNICATION IN PARALLEL DISTRIBUTED-MEMORY DENSE SOLVERS
inferredcites →https://doi.org/10.1023/a:1013588221172openalex-snapshot
Bulk-Synchronous Parallel Gaussian Elimination
inferredcites →https://doi.org/10.1090/s0002-9904-1949-09320-5openalex-snapshot
An inequality related to the isoperimetric inequality
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/ipdps.2008.4536305openalex-snapshot
Avoiding communication in sparse matrix computations
inferredcites →https://doi.org/10.1109/sfcs.1993.366817openalex-snapshot
Efficient out-of-core algorithms for linear relaxation using blocking covers
inferredcites →https://doi.org/10.1109/tc.1985.1676570openalex-snapshot
Analysis of Pairwise Pivoting in Gaussian Elimination
inferredcites →https://doi.org/10.1137/090769156openalex-snapshot
Minimizing Communication in Numerical Linear Algebra
inferredcites →https://doi.org/10.1137/0909037openalex-snapshot
Parallel Solution of Triangular Systems on Distributed-Memory Multiprocessors
inferredcites →https://doi.org/10.1137/100788926openalex-snapshot
CALU: A Communication Optimal LU Factorization Algorithm
inferredcites →https://doi.org/10.1137/120881191openalex-snapshot
Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods
inferredcites →https://doi.org/10.1145/155332.155333openalex-snapshot
LogP: towards a realistic model of parallel computation
inferredcites →https://doi.org/10.1145/1654059.1654096openalex-snapshot
Minimizing communication in sparse matrix solvers
inferredcites →https://doi.org/10.1145/2612669.2612671openalex-snapshot
Tradeoffs between synchronization, communication, and computation in parallel linear algebra computations
inferredcites →https://doi.org/10.1145/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation
inferredcites →https://doi.org/10.21236/ada584726openalex-snapshot
Communication Lower Bounds and Optimal Algorithms for Programs that Reference Arrays - Part 1
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-20656-7_8openalex-snapshot
Toward Efficient Architecture-Independent Algorithms for Dynamic Programs
inferred← citeshttps://doi.org/10.1007/s42514-019-00011-xopenalex-snapshot
Trade-offs between computation, communication, and synchronization in stencil-collective alternate update
inferred← citeshttps://doi.org/10.1038/s43588-021-00086-zopenalex-snapshot
Undisclosed, unmet and neglected challenges in multi-omics studies
inferred← citeshttps://doi.org/10.1109/icced.2018.00036openalex-snapshot
Classification and Advantages Parallel Computing in Process Computation: A Systematic Literature Review
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00020openalex-snapshot
Communication-Avoiding Cholesky-QR2 for Rectangular Matrices
inferred← citeshttps://doi.org/10.1109/ises52644.2021.00021openalex-snapshot
Timing Analysis in Multi-Core Real Time Systems
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.1137/20m1338599openalex-snapshot
Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions
inferred← citeshttps://doi.org/10.1145/3210377.3210415openalex-snapshot
A 3D Parallel Algorithm for QR Decomposition
inferred← citeshttps://doi.org/10.1145/3225058.3225140openalex-snapshot
Communication-Avoiding for Dynamical Core of Atmospheric General Circulation Model
inferred← citeshttps://doi.org/10.1145/3293883.3299109openalex-snapshot
Toward efficient architecture-independent algorithms for dynamic programs
inferred← citeshttps://doi.org/10.1145/3409964.3461796openalex-snapshot
Pebbles, Graphs, and a Pinch of Combinatorics
inferred← citeshttps://doi.org/10.1145/3437801.3441590openalex-snapshot
On the parallel I/O optimality of linear algebra kernels
inferred← citeshttps://doi.org/10.1145/3490148.3538587openalex-snapshot
I/O-Optimal Algorithms for Symmetric Linear Algebra Kernels
inferred← citeshttps://doi.org/10.1145/3539781.3539785openalex-snapshot
Reducing communication in the conjugate gradient method
inferred← citeshttps://doi.org/10.1145/3581784.3607067openalex-snapshot
High-Performance and Programmable Attentional Graph Neural Networks with Global Tensor Formulations
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.3929/ethz-b-000518903openalex-snapshot
On the Parallel I/O Optimality of Linear Algebra Kernels: Near-Optimal Matrix Factorizations
inferred← citeshttps://doi.org/10.47194/ijgor.v1i3.44openalex-snapshot
Detecting Similarities in Posts Using Vector Space and Matrix
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.