On the public citation graph
Towards a single model of efficient computation in real parallel machines
0 signed · 39 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-19488-6_126openalex-snapshot
A complexity theory of efficient parallel algorithms
inferredcites →https://doi.org/10.1007/bf00264615openalex-snapshot
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
inferredcites →https://doi.org/10.1007/bf01759076openalex-snapshot
Deterministic parallel list ranking
inferredcites →https://doi.org/10.1007/bf01840376openalex-snapshot
Efficient parallel algorithms for graph problems
inferredcites →https://doi.org/10.1007/bfb0040376openalex-snapshot
Deterministic parallel list ranking
inferredcites →https://doi.org/10.1016/0020-0190(89)90023-9openalex-snapshot
A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation
inferredcites →https://doi.org/10.1016/0304-3975(90)90188-nopenalex-snapshot
Communication complexity of PRAMs
inferredcites →https://doi.org/10.1016/0304-3975(90)90192-kopenalex-snapshot
A complexity theory of efficient parallel algorithms
inferredcites →https://doi.org/10.1016/0743-7315(89)90005-1openalex-snapshot
Parallel algorithms for computing linked list prefix
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50023-0openalex-snapshot
General Purpose Parallel Architectures
inferredcites →https://doi.org/10.1109/sfcs.1985.9openalex-snapshot
An optimal parallel algorithm for integer sorting
inferredcites →https://doi.org/10.1109/sfcs.1988.21942openalex-snapshot
Universal packet routing algorithms
inferredcites →https://doi.org/10.1109/tc.1985.5009385openalex-snapshot
Tight Bounds on the Complexity of Parallel Sorting
inferredcites →https://doi.org/10.1126/science.231.4741.967openalex-snapshot
Parallel Supercomputing Today and the Cedar Approach
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.1145/100216.100240openalex-snapshot
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
inferredcites →https://doi.org/10.1145/62.322423openalex-snapshot
Complexity Results for Permuting Data and Other Computations on Parallel Processors
inferredcites →https://doi.org/10.1145/72935.72937openalex-snapshot
On communication latency in PRAM computations
inferredcites →https://doi.org/10.21236/ada204273openalex-snapshot
Universal Packet Routing Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpa.3160480904openalex-snapshot
Upper and lower bounds for recurrent and recursively decomposable parallel processor‐networks
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1140openalex-snapshot
Programming Environment for Phase-Reconfigurable Parallel Programming on SuperNode
inferred← citeshttps://doi.org/10.1006/jpdc.2000.1698openalex-snapshot
Optimal and Efficient Algorithms for Summing and Prefix Summing on Parallel Machines
inferred← citeshttps://doi.org/10.1007/3-540-45718-6_65openalex-snapshot
Architecture Independent Analysis of Parallel Programs
inferred← citeshttps://doi.org/10.1007/bf01407840openalex-snapshot
Models for practical parallel computation
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.1016/0167-6423(93)90014-gopenalex-snapshot
Deriving parallel programs from specifications using cost information
inferred← citeshttps://doi.org/10.1016/0167-739x(92)90038-dopenalex-snapshot
Developing a software interface for the dynamically reconfigurable SuperNode multiprocessor
inferred← citeshttps://doi.org/10.1016/0743-7315(92)90034-kopenalex-snapshot
A practical hierarchical model of parallel computation I. The model
inferred← citeshttps://doi.org/10.1016/j.jpdc.2008.12.003openalex-snapshot
Fast problem-size-independent parallel prefix circuits
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00023-6openalex-snapshot
Optimal broadcast on parallel locality models
inferred← citeshttps://doi.org/10.1109/aispas.1995.401331openalex-snapshot
Dynamic randomized simulation of hierarchical PRAMs on meshes
inferred← citeshttps://doi.org/10.1109/spdp.1991.218301openalex-snapshot
A practical hierarchical model of parallel computation
inferred← citeshttps://doi.org/10.1109/spdp.1995.530734openalex-snapshot
A structural theory of recursively decomposable parallel processor-networks
inferred← citeshttps://doi.org/10.1145/290409.290412openalex-snapshot
A quantitative comparison of parallel computation models
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.