On the public citation graph

Randomized parallel list ranking for distributed memory multiprocesors

https://doi.org/10.1007/bfb0027774
0 signed · 35 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jpdc.1994.1085openalex-snapshot
Direct Bulk-Synchronous Parallel Algorithms
inferredcites →https://doi.org/10.1007/3-540-55706-7_1openalex-snapshot
Direct bulk-synchronous parallel algorithms
inferredcites →https://doi.org/10.1007/3-540-58325-4_232openalex-snapshot
A convex hull algorithm on coarse-grained multiprocessor
inferredcites →https://doi.org/10.1007/bfb0040376openalex-snapshot
Deterministic parallel list ranking
inferredcites →https://doi.org/10.1016/0020-0190(90)90196-5openalex-snapshot
A simple randomized parallel algorithm for list-ranking
inferredcites →https://doi.org/10.1016/0273-1177(89)90053-7openalex-snapshot
Biological effects of galactic radiation HZE particles in experiments on the orbital station Salyut 7
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50023-0openalex-snapshot
General Purpose Parallel Architectures
inferredcites →https://doi.org/10.1016/s0019-9958(86)80046-8openalex-snapshot
Solving tree problems on a mesh-connected processor array
inferredcites →https://doi.org/10.1109/5.92042openalex-snapshot
A comparison of shared and nonshared memory models of parallel computation
inferredcites →https://doi.org/10.1109/ipps.1995.395892openalex-snapshot
Efficient routing and message bounds for optimal parallel algorithms
inferredcites →https://doi.org/10.1109/spdp.1994.346119openalex-snapshot
Scalable and architecture independent parallel geometric algorithms with high probability optimal time
inferredcites →https://doi.org/10.1109/spdp.1994.346125openalex-snapshot
Good algorithm design style for multiprocessors
inferredcites →https://doi.org/10.1137/0217009openalex-snapshot
Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
inferredcites →https://doi.org/10.1137/0220070openalex-snapshot
Parallel Tree Contraction Part 2: Further Applications
inferredcites →https://doi.org/10.1145/113379.113380openalex-snapshot
A comparison of sorting algorithms for the connection machine CM-2
inferredcites →https://doi.org/10.1145/160985.161154openalex-snapshot
Scalable parallel geometric algorithms for coarse grained multicomputers
inferredcites →https://doi.org/10.1145/181014.181049openalex-snapshot
List ranking and list scan on the Cray C-90
inferredcites →https://doi.org/10.1145/181014.192329openalex-snapshot
Parallel sorting by over partitioning
inferredcites →https://doi.org/10.1145/215399.215410openalex-snapshot
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers
inferredcites →https://doi.org/10.1145/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation
inferredcites →https://doi.org/10.1146/annurev.cs.01.060186.001445openalex-snapshot
Type Architectures, Shared Memory, and the Corollary of Modest Potential

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-44691-5_10openalex-snapshot
Portable List Ranking: An Experimental Study
inferred← citeshttps://doi.org/10.1007/3-540-45255-9_13openalex-snapshot
Handling Graphs According to a Coarse Grained Approach: Experiments with PVM and MPI
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_195openalex-snapshot
Efficient parallel graph algorithms for coarse grained multicomputers and BSP
inferred← citeshttps://doi.org/10.1007/978-1-4757-3609-0_6openalex-snapshot
Parallel Graph Algorithms for Coarse-Grained Multicomputers
inferred← citeshttps://doi.org/10.1007/978-3-540-39924-7_20openalex-snapshot
CGMgraph/CGMlib: Implementing and Testing CGM Graph Algorithms on PC Clusters
inferred← citeshttps://doi.org/10.1007/978-3-540-45209-6_123openalex-snapshot
Minimizing Global Communication in Parallel List Ranking
inferred← citeshttps://doi.org/10.1007/s00453-001-0109-4openalex-snapshot
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP
inferred← citeshttps://doi.org/10.1109/ccgrid.2017.122openalex-snapshot
Scalable Assembly for Massive Genomic Graphs
inferred← citeshttps://doi.org/10.1109/icpp.2016.29openalex-snapshot
SWAP-Assembler 2: Optimization of De Novo Genome Assembler at Extreme Scale
inferred← citeshttps://doi.org/10.1142/s0129054199000277openalex-snapshot
PARALLEL RANGE MINIMA ON COARSE GRAINED MULTICOMPUTERS
inferred← citeshttps://doi.org/10.1145/944618.944625openalex-snapshot
Portable list ranking
inferred← citeshttps://doi.org/10.1177/1094342005051196openalex-snapshot
CGMGRAPH/CGMLIB: Implementing and Testing CGM Graph Algorithms on PC Clusters and Shared Memory Machines
inferred← citeshttps://doi.org/10.1186/1471-2105-10-s1-s14openalex-snapshot
Parallel short sequence assembly of transcriptomes
inferred← citeshttps://doi.org/10.31274/etd-180810-1382openalex-snapshot
Parallel methods for short read assembly
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.