On the public citation graph
Randomized parallel list ranking for distributed memory multiprocessors
0 signed · 54 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/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.1006/jpdc.2000.1659openalex-snapshot
Fully Scalable Fault-Tolerant Simulations for BSP and CGM
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-032-35251-4_40openalex-snapshot
Engineering Scalable Distributed List Ranking
inferred← citeshttps://doi.org/10.1007/978-981-95-0695-8_22openalex-snapshot
An Efficient Parallel List Ranking Algorithm for Graph Concatenation on BSP Graph System
inferred← citeshttps://doi.org/10.1007/bfb0056600openalex-snapshot
Portable randomized list ranking on multiprocessors using MPI
inferred← citeshttps://doi.org/10.1007/bfb0097993openalex-snapshot
A range minima parallel algorithm for coarse grained multicomputers
inferred← citeshttps://doi.org/10.1109/ipps.1999.760445openalex-snapshot
Fully-scalable fault-tolerant simulations for BSP and CGM
inferred← citeshttps://doi.org/10.1109/reldis.1998.740525openalex-snapshot
Practical parallel algorithms for minimum spanning trees
inferred← citeshttps://doi.org/10.1109/tcbb.2018.2858797openalex-snapshot
Fast de Bruijn Graph Compaction in Distributed Memory Environments
inferred← citeshttps://doi.org/10.1137/1.9781611973730.30openalex-snapshot
Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel
inferred← citeshttps://doi.org/10.1145/3018787openalex-snapshot
Shared-Memory Parallelism Can Be Simple, Fast, and Scalable
inferred← citeshttps://doi.org/10.1145/3018787.3018791openalex-snapshot
Internally Deterministic Parallelism: Techniques and Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018792openalex-snapshot
Deterministic Parallelism in Sequential Iterative Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018793openalex-snapshot
A Deterministic Phase-Concurrent Parallel Hash Table
inferred← citeshttps://doi.org/10.1145/3018787.3018794openalex-snapshot
Priority Updates: A Contention-Reducing Primitive for Deterministic Programming
inferred← citeshttps://doi.org/10.1145/3018787.3018795openalex-snapshot
Ligra: A Lightweight Graph Processing Framework for Shared Memory
inferred← citeshttps://doi.org/10.1145/3018787.3018796openalex-snapshot
Ligra+: Adding Compression to Ligra
inferred← citeshttps://doi.org/10.1145/3018787.3018797openalex-snapshot
Linear-Work Parallel Graph Connectivity
inferred← citeshttps://doi.org/10.1145/3018787.3018798openalex-snapshot
Parallel and Cache-Oblivious Triangle Computations
inferred← citeshttps://doi.org/10.1145/3018787.3018799openalex-snapshot
Parallel Cartesian Tree and Suffix Tree Construction
inferred← citeshttps://doi.org/10.1145/3018787.3018800openalex-snapshot
Parallel Computation of Longest Common Prefixes
inferred← citeshttps://doi.org/10.1145/3018787.3018801openalex-snapshot
Parallel Lempel-Ziv Factorization
inferred← citeshttps://doi.org/10.1145/3018787.3018802openalex-snapshot
Parallel Wavelet Tree Construction
inferred← citeshttps://doi.org/10.1186/1471-2105-15-s9-s2openalex-snapshot
SWAP-Assembler: scalable and efficient genome assembly towards thousands of cores
inferred← citeshttps://doi.org/10.22215/etd/2007-07899openalex-snapshot
A parallel external memory system
inferred← citeshttps://doi.org/10.22215/etd/2011-09053openalex-snapshot
Exploring the limits of GPUs with parallel graph algorithms
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.