On the public citation graph
Scalable computing
0 signed · 79 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.1007/978-3-642-61812-3_32openalex-snapshot
Preliminary Discussion of the Logical Design of an Electronic Computing Instrument
inferredcites →https://doi.org/10.1016/0020-0190(94)00046-8openalex-snapshot
Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results
inferredcites →https://doi.org/10.1016/0304-3975(90)90188-nopenalex-snapshot
Communication complexity of PRAMs
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50023-0openalex-snapshot
General Purpose Parallel Architectures
inferredcites →https://doi.org/10.1109/hicss.1995.375451openalex-snapshot
Bulk synchronous parallel computing-a paradigm for transportable software
inferredcites →https://doi.org/10.1112/plms/s2-42.1.230openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem
inferredcites →https://doi.org/10.1145/140901.140906openalex-snapshot
Efficient optical communication in parallel computers
inferredcites →https://doi.org/10.1145/169627.169724openalex-snapshot
Parallel programming in Split-C
inferredcites →https://doi.org/10.1145/223982.224443openalex-snapshot
Empirical evaluation of the CRAY-T3D
inferredcites →https://doi.org/10.1145/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1096-9128(199909)11:11<655::aid-cpe449>3.0.co;2-7openalex-snapshot
Methodology and tools for system analysis of parallel pipelines
inferred← citeshttps://doi.org/10.1002/(sici)1096-9128(20000410)12:4<211::aid-cpe477>3.0.co;2-ropenalex-snapshot
PRAM programming: in theory and in practice
inferred← citeshttps://doi.org/10.1007/10720115_2openalex-snapshot
A Visual BSP Programming Environment for Distributed Computing
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_28openalex-snapshot
Average-Case Communication-Optimal Parallel Parenthesis Matching
inferred← citeshttps://doi.org/10.1007/3-540-47849-3_22openalex-snapshot
Decomposable Bulk Synchronous Parallel Computers
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_15openalex-snapshot
All-Pairs Shortest Paths Computation in the BSP Model
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_2openalex-snapshot
BSP Algorithms — “Write Once, Run Anywhere”
inferred← citeshttps://doi.org/10.1007/3-540-48387-x_33openalex-snapshot
BSP Performance Analysis and Prediction: Tools and Application
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_75openalex-snapshot
BSP-like external-memory computation
inferred← citeshttps://doi.org/10.1007/3-540-62598-4_78openalex-snapshot
Basic techniques for numerical linear algebra on bulk synchronous parallel computers
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-540-25935-0_15openalex-snapshot
Optimizing Sequences of Skeleton Calls
inferred← citeshttps://doi.org/10.1007/978-3-540-45145-7_35openalex-snapshot
Communication-Efficient Parallel Gaussian Elimination
inferred← citeshttps://doi.org/10.1007/978-3-642-14390-8_19openalex-snapshot
Parallel Longest Increasing Subsequences in Scalable Time and Memory
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-94-015-9608-4_9openalex-snapshot
A Personal, Historical Perspective of Parallel Programming for High Performance
inferred← citeshttps://doi.org/10.1007/bfb0024720openalex-snapshot
The bulk-synchronous parallel random access machine
inferred← citeshttps://doi.org/10.1007/bfb0024721openalex-snapshot
The E-BSP model: Incorporating general locality and unbalanced communication into the BSP model
inferred← citeshttps://doi.org/10.1007/bfb0024766openalex-snapshot
Theory, practice, and a tool for BSP performance prediction
inferred← citeshttps://doi.org/10.1007/bfb0031604openalex-snapshot
A two-way BSP algorithm for tridiagonal systems
inferred← citeshttps://doi.org/10.1007/bfb0055078openalex-snapshot
Bulk-synchronous parallel multiplication of boolean matrices
inferred← citeshttps://doi.org/10.1007/bfb0056600openalex-snapshot
Portable randomized list ranking on multiprocessors using MPI
inferred← citeshttps://doi.org/10.1007/s00446-016-0270-2openalex-snapshot
Algebraic methods in the congested clique
inferred← citeshttps://doi.org/10.1007/s00607-004-0102-2openalex-snapshot
Parallel -Matrix Arithmetics on Shared Memory Systems
inferred← citeshttps://doi.org/10.1007/s00791-005-0001-xopenalex-snapshot
Fast parallel solution of boundary integral equations and related problems
inferred← citeshttps://doi.org/10.1007/s10586-006-9746-3openalex-snapshot
Finding Hamiltonian paths in tournaments on clusters
inferred← citeshttps://doi.org/10.1016/j.procs.2012.04.201openalex-snapshot
Parallel Tree Reduction on MapReduce
inferred← citeshttps://doi.org/10.1016/s0167-739x(01)00038-3openalex-snapshot
Efficient parallel algorithms for numerical simulation
inferred← citeshttps://doi.org/10.1016/s0167-739x(01)00068-1openalex-snapshot
Architecture independent parallel algorithm design: theory vs practice
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00093-3openalex-snapshot
BSPlib: The BSP programming library
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00111-2openalex-snapshot
Parallel m-step preconditioners for the conjugate gradient method
inferred← citeshttps://doi.org/10.1023/a:1008052613798openalex-snapshot
Parallel Performance Analysis of the Improved Quasi-Minimal Residual Method on Bulk Synchronous Parallel Architectures
inferred← citeshttps://doi.org/10.1023/a:1013588221172openalex-snapshot
Bulk-Synchronous Parallel Gaussian Elimination
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/32.842952openalex-snapshot
Toward formally-based design of message passing programs
inferred← citeshttps://doi.org/10.1109/eidwt.2013.140openalex-snapshot
Dynamic Creation of BSP/CGM Clusters on Cloud Computing Platforms
inferred← citeshttps://doi.org/10.1109/icdmw.2010.120openalex-snapshot
Distributed Flow Algorithms for Scalable Similarity Visualization
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016540openalex-snapshot
Algorithms for SMP-clusters dense matrix-vector multiplication
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/ipps.1999.760522openalex-snapshot
Optimization rules for programming with collective operations
inferred← citeshttps://doi.org/10.1109/mppm.1997.715958openalex-snapshot
(De) composition rules for parallel scan and reduction
inferred← citeshttps://doi.org/10.1109/tnb.2003.810165openalex-snapshot
Parallel pattern identification in biological sequences on clusters
inferred← citeshttps://doi.org/10.1109/tpds.2003.1233716openalex-snapshot
Optimal semi-oblique tiling
inferred← citeshttps://doi.org/10.1142/s0129054103001595openalex-snapshot
DESIGNING PARALLEL ALGORITHMS FOR HIERARCHICAL SMP CLUSTERS
inferred← citeshttps://doi.org/10.1142/s0129626403001318openalex-snapshot
BSPGRID: VARIABLE RESOURCES PARALLEL COMPUTATION AND MULTIPROGRAMMED PARALLELISM
inferred← citeshttps://doi.org/10.1145/2767386.2767414openalex-snapshot
Algebraic Methods in the Congested Clique
inferred← citeshttps://doi.org/10.1145/3350755.3400225openalex-snapshot
Communication vs Synchronisation in Parallel String Comparison
inferred← citeshttps://doi.org/10.1145/564870.564901openalex-snapshot
Optimal tiling for the RNA base pairing problem
inferred← citeshttps://doi.org/10.14529/cmse190304openalex-snapshot
Survey of Parallel Computation Models
inferred← citeshttps://doi.org/10.1525/001c.87980openalex-snapshot
Pluralising the Planetary: The Radical Incompleteness of Machinic Envisioning
inferred← citeshttps://doi.org/10.23919/eusipco63174.2024.10715023openalex-snapshot
Multicore and Network Topology Codesign for Pareto-Optimal Multinode Architecture
inferred← citeshttps://doi.org/10.70675/ee0b611cz9b27z4b0eza6cez5ff275ab0fecopenalex-snapshot
Combining active object and BSP programs
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.