On the public citation graph
Parallel priority Queue and list contraction: The BSP approach
0 signed · 22 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-1-4684-5511-3_9openalex-snapshot
Optimal Tree Contraction in the EREW Model
inferredcites →https://doi.org/10.1007/bf01762110openalex-snapshot
Communication-efficient parallel algorithms for distributed random-access machines
inferredcites →https://doi.org/10.1007/bfb0024725openalex-snapshot
Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model
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/s0019-9958(86)80023-7openalex-snapshot
Deterministic coin tossing with applications to optimal parallel list ranking
inferredcites →https://doi.org/10.1016/s0020-0190(05)80007-9openalex-snapshot
Parallel priority queues
inferredcites →https://doi.org/10.1017/cbo9781107359949.008openalex-snapshot
On the method of bounded differences
inferredcites →https://doi.org/10.1109/sfcs.1985.43openalex-snapshot
Parallel tree contraction and its application
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/174130.174145openalex-snapshot
Randomized parallel algorithms for backtrack search and branch-and-bound computation
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/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.1007/978-3-540-30566-8_29openalex-snapshot
Algorithmic-Parameter Optimization of a Parallelized Split-Step Fourier Transform Using a Modified BSP Cost Model
inferred← citeshttps://doi.org/10.1016/j.jda.2005.01.001openalex-snapshot
An architecture independent study of parallel segment trees
inferred← citeshttps://doi.org/10.1016/j.parco.2014.12.002openalex-snapshot
Extending the BSP model for multi-core and out-of-core computing: MBSP
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00572-8openalex-snapshot
Architecture independent parallel selection with applications to parallel priority queues
inferred← citeshttps://doi.org/10.1109/empdp.2000.823411openalex-snapshot
Specification for reactive bulk-synchronous programming
inferred← citeshttps://doi.org/10.1109/ipdps.2011.372openalex-snapshot
Memory Hierarchy Aware Parallel Priority Based Data Structures
inferred← citeshttps://doi.org/10.1109/mppm.1997.715965openalex-snapshot
The high performance solution of irregular problems
inferred← citeshttps://doi.org/10.1142/s0129626408003211openalex-snapshot
A MODULAR IMPLEMENTATION OF DATA STRUCTURES IN BULK-SYNCHRONOUS PARALLEL ML
inferred← citeshttps://doi.org/10.1142/s179383091450061xopenalex-snapshot
A randomized sorting algorithm on the BSP model
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0612105openalex-snapshot
Towards Parallel Computing on the Internet: Applications, Architectures, Models and Programming Tools
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.