On the public citation graph

A foundation for advanced compile-time analysis of linda programs

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.
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.1007/3-540-48319-5openalex-snapshot
Languages and Compilers for Parallel Computing
inferredcites →https://doi.org/10.1007/978-1-4684-5511-3_36openalex-snapshot
The Linda Machine
inferredcites →https://doi.org/10.1007/bf00128175openalex-snapshot
Compiling programs for distributed-memory multiprocessors
inferredcites →https://doi.org/10.1016/0167-8191(88)90002-6openalex-snapshot
SUPERB: A tool for semi-automatic MIMD/SIMD parallelization
inferredcites →https://doi.org/10.1145/13310.13328openalex-snapshot
Interprocedural dependence analysis and parallelization
inferredcites →https://doi.org/10.1145/2363.2433openalex-snapshot
Generative communication in Linda
inferredcites →https://doi.org/10.1145/512644.512656openalex-snapshot
A parallel language and its compilation to multiprocessor machines or VLSI
inferredcites →https://doi.org/10.1145/512644.512666openalex-snapshot
Distributed data structures in Linda
inferredcites →https://doi.org/10.1145/63334.63337openalex-snapshot
Linda in context
inferredcites →https://doi.org/10.1145/7902.7904openalex-snapshot
Advanced compiler optimizations for supercomputers
inferredcites →https://doi.org/10.5860/choice.29-0353openalex-snapshot
How to write parallel programs: a first course

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45307-5_8openalex-snapshot
Learning from the Success of MPI
inferred← citeshttps://doi.org/10.1007/3-540-48387-x_34openalex-snapshot
Message Passing vs Tuple Space Coordination in an Aerodynamics Application*
inferred← citeshttps://doi.org/10.1007/3-540-57502-2_45openalex-snapshot
Data parallelism and Linda
inferred← citeshttps://doi.org/10.1007/3-540-63383-9_69openalex-snapshot
From weaving threads to untangling the web: A view of coordination from Linda's perspective
inferred← citeshttps://doi.org/10.1007/978-0-387-34887-2_12openalex-snapshot
EC : A Language for Distributed Computing
inferred← citeshttps://doi.org/10.1007/bf02577872openalex-snapshot
Case studies in asynchronous data parallelism
inferred← citeshttps://doi.org/10.1016/0167-8191(94)90032-9openalex-snapshot
The Linda alternative to message-passing systems
inferred← citeshttps://doi.org/10.1109/case.1992.200154openalex-snapshot
A CASE environment for parallel programming
inferred← citeshttps://doi.org/10.1109/iccl.1998.674177openalex-snapshot
Data flow analysis across tuplespace process boundaries
inferred← citeshttps://doi.org/10.1145/298151.298229openalex-snapshot
On the semantics of tuple-based coordination models
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0109017openalex-snapshot
Learning from the Success of MPI
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.