On the public citation graph

A layered method for process and code mapping

https://doi.org/10.1007/bf03037398
0 signed · 20 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-16492-8_82openalex-snapshot
Compiling OR-parallelism into AND-parallelism
inferredcites →https://doi.org/10.1007/bf01414556openalex-snapshot
A parallel implementation of Flat Concurrent Prolog
inferredcites →https://doi.org/10.1016/0743-7315(87)90036-0openalex-snapshot
Notes on the complexity of systolic programs
inferredcites →https://doi.org/10.1109/c-m.1978.218272openalex-snapshot
Control of Distributed Processes
inferredcites →https://doi.org/10.1109/tc.1981.1675756openalex-snapshot
On the Mapping Problem
inferredcites →https://doi.org/10.1109/tse.1977.233840openalex-snapshot
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
inferredcites →https://doi.org/10.7907/jbjjk-eke62openalex-snapshot
Placement of Communicating Processes on Multiprocessor Networks

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-45628-7_5openalex-snapshot
Logic Programming Languages for the Internet
inferred← citeshttps://doi.org/10.1007/978-3-642-76799-9_10openalex-snapshot
The Family of Concurrent Logic Programming Languages
inferred← citeshttps://doi.org/10.1007/bf01414556openalex-snapshot
A parallel implementation of Flat Concurrent Prolog
inferred← citeshttps://doi.org/10.1007/bf01887205openalex-snapshot
Meta-interpreters and partial evaluation in Parlog
inferred← citeshttps://doi.org/10.1016/0167-739x(91)90001-eopenalex-snapshot
Heuristic search in PARLOG using replicated worker style parallelism
inferred← citeshttps://doi.org/10.1016/0743-1066(89)90011-3openalex-snapshot
A sequential abstract machine for flat concurrent prolog
inferred← citeshttps://doi.org/10.1016/0743-1066(89)90016-2openalex-snapshot
OR-parallel PROLOG in flat concurrent PROLOG
inferred← citeshttps://doi.org/10.1016/0743-7315(87)90036-0openalex-snapshot
Notes on the complexity of systolic programs
inferred← citeshttps://doi.org/10.1145/63047.63092openalex-snapshot
FCP: a summary of performance results
inferred← citeshttps://doi.org/10.1145/72551.72552openalex-snapshot
Programming languages for distributed computing systems
inferred← citeshttps://doi.org/10.1145/72551.72555openalex-snapshot
The family of concurrent logic programming languages
inferred← citeshttps://doi.org/10.1145/99583.99615openalex-snapshot
Communication with directed logic variables
inferred← citeshttps://doi.org/10.5753/sbac-pad.1995.19891openalex-snapshot
Um sistema de execução de programas paralelos orientados a objetos em sistemas distribuídos
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.