On the public citation graph

Parallel and distributed algorithms

https://doi.org/10.1002/cpe.4663
0 signed · 15 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.1002/cpe.4471openalex-snapshot
Quantifying the impact of shutdown techniques for energy‐efficient data centers
inferredcites →https://doi.org/10.1002/cpe.4473openalex-snapshot
Distributed geometric nonnegative matrix factorization and hierarchical alternating least squares–based nonnegative tensor factorization with the MapReduce paradigm
inferredcites →https://doi.org/10.1002/cpe.4490openalex-snapshot
Evaluation of dataflow programming models for electronic structure theory
inferredcites →https://doi.org/10.1002/cpe.4494openalex-snapshot
A mirroring architecture for sophisticated mobile games using computation‐offloading
inferredcites →https://doi.org/10.1002/cpe.4502openalex-snapshot
Fast approximation algorithms for task‐based runtime systems

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-89335-6_20openalex-snapshot
The Asynchronous Bounded-Cycle Model
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.08.001openalex-snapshot
The Asynchronous Bounded-Cycle model
inferred← citeshttps://doi.org/10.1109/access.2023.3293734openalex-snapshot
Beyond 0-1: The 1-N Principle and Fast Validation of N-Sorter Sorting Networks
inferred← citeshttps://doi.org/10.1109/discex.2000.821538openalex-snapshot
Enlisting event patterns for cyber battlefield awareness
inferred← citeshttps://doi.org/10.1142/s0219265903000830openalex-snapshot
Notification-Based QOS Control Protocol for Group Communication
inferred← citeshttps://doi.org/10.1142/s0219265903000891openalex-snapshot
Autonomic Group Communication Protocol
inferred← citeshttps://doi.org/10.1145/2043643.2043650openalex-snapshot
Relativistic Causality and Clockless Circuits
inferred← citeshttps://doi.org/10.1145/2931037.2931068openalex-snapshot
Efficient race detection in the presence of programmatic event loops
inferred← citeshttps://doi.org/10.1145/3009837.3009888openalex-snapshot
On verifying causal consistency
inferred← citeshttps://doi.org/10.1145/3140587.3062374openalex-snapshot
Dynamic race prediction in linear time
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.