On the public citation graph
Parallel matrix transpose algorithms on distributed memory concurrent computers
0 signed · 16 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.1016/s0015-1882(99)80031-7openalex-snapshot
Los Alamos national laboratory
inferredcites →https://doi.org/10.1109/t-c.1972.223584openalex-snapshot
A Fast Computer Method for Matrix Transposing
inferredcites →https://doi.org/10.12988/amsopenalex-snapshot
Ruin theory under a generalized jump-diffusion model with regime switching
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.4330060702openalex-snapshot
Pumma: Parallel universal matrix multiplication algorithms on distributed memory concurrent computers
inferred← citeshttps://doi.org/10.1002/cpe.920openalex-snapshot
The performance of parallel matrix algorithms on a broadcast‐based architecture
inferred← citeshttps://doi.org/10.1007/3-540-60902-4_12openalex-snapshot
ScaLAPACK: A portable linear algebra library for distributed memory computers — Design issues and performance
inferred← citeshttps://doi.org/10.1007/3-540-60902-4_13openalex-snapshot
A proposal for a set of parallel basic linear algebra subprograms
inferred← citeshttps://doi.org/10.1016/0010-4655(96)00017-3openalex-snapshot
ScaLAPACK: a portable linear algebra library for distributed memory computers — design issues and performance
inferred← citeshttps://doi.org/10.1016/0167-8191(94)00094-qopenalex-snapshot
Basic routines for the Rank-2k update: 2D torus vs reconfigurable network
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00050-xopenalex-snapshot
Transposing a matrix on a vector computer
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00110-5openalex-snapshot
The parallel ‘Deutschland-Modell’ — A message-passing version for distributed memory computers
inferred← citeshttps://doi.org/10.1016/s0377-0427(96)00109-4openalex-snapshot
Improved parallel QR method for large least squares problems involving Kronecker products
inferred← citeshttps://doi.org/10.1109/71.473513openalex-snapshot
Optimal multicast communication in wormhole-routed torus networks
inferred← citeshttps://doi.org/10.1109/71.819945openalex-snapshot
Efficient algorithms for block-cyclic array redistribution between processor sets
inferred← citeshttps://doi.org/10.1109/71.841744openalex-snapshot
Design and performance evaluation of a portable parallel library for space-time adaptive processing
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.