On the public citation graph

Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model

https://doi.org/10.1007/bfb0024725
0 signed · 30 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-53487-3_46openalex-snapshot
Randomized parallel selection
inferredcites →https://doi.org/10.1007/3-540-60313-1_131openalex-snapshot
Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model
inferredcites →https://doi.org/10.1007/3-540-60321-2_30openalex-snapshot
Fast priority queues for parallel branch-and-bound
inferredcites →https://doi.org/10.1007/bf00128644openalex-snapshot
Parallel heap: An optimal parallel priority queue
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(76)90073-9openalex-snapshot
Information Processing Letters
inferredcites →https://doi.org/10.1016/0020-0190(88)90186-xopenalex-snapshot
An optimally efficient selection algorithm
inferredcites →https://doi.org/10.1016/s0020-0190(05)80007-9openalex-snapshot
Parallel priority queues
inferredcites →https://doi.org/10.1016/s0304-3975(98)00020-6openalex-snapshot
Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
inferredcites →https://doi.org/10.1109/ipps.1996.508072openalex-snapshot
Practical parallel algorithms for dynamic data redistribution, median finding, and selection
inferredcites →https://doi.org/10.1109/spdp.1994.346131openalex-snapshot
Parallelism and locality in priority queues
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/237502.237561openalex-snapshot
Deterministic sorting and randomized median finding on the BSP model
inferredcites →https://doi.org/10.1145/322326.322329openalex-snapshot
Parallel permutation and sorting algorithms and a new generalized connection network

What points at this work

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

inferred← citeshttps://doi.org/10.1002/scj.1170openalex-snapshot
Parallel algorithms for selection on the BSP and BSP* models
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1429openalex-snapshot
Randomized Priority Queues for Fast Parallel Access
inferred← citeshttps://doi.org/10.1006/jpdc.2000.1647openalex-snapshot
Parallel Load Balancing for Problems with Good Bisectors
inferred← citeshttps://doi.org/10.1007/3-540-36383-1_1openalex-snapshot
Algorithm Engineering for Parallel Computation
inferred← citeshttps://doi.org/10.1007/3-540-63138-0_21openalex-snapshot
Communication efficient parallel searching
inferred← citeshttps://doi.org/10.1007/bfb0002764openalex-snapshot
Parallel priority Queue and list contraction: The BSP approach
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.1998.647194openalex-snapshot
PRAM programming: theory vs. practice
inferred← citeshttps://doi.org/10.1109/ipps.1999.760528openalex-snapshot
Parallel load balancing for problems with good bisectors
inferred← citeshttps://doi.org/10.1109/ispan.1999.778969openalex-snapshot
Parallel selection algorithms with analysis on clusters
inferred← citeshttps://doi.org/10.1145/277651.277662openalex-snapshot
Communication-optimal parallel minimum spanning tree algorithms (extended abstract)
inferred← citeshttps://doi.org/10.1145/330560.331004openalex-snapshot
Coarse grained parallel computing on heterogeneous systems
inferred← citeshttps://doi.org/10.1145/3409964.3461782openalex-snapshot
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
showing the first 14 of 15 · page through all 15
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.