On the public citation graph
A multicomputer garbage collector for a single-assignment language
0 signed · 23 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-17945-3_10openalex-snapshot
Distributed garbage collection using reference counting
inferredcites →https://doi.org/10.1007/3-540-17945-3_25openalex-snapshot
An efficient garbage collection scheme for parallel computer architectures
inferredcites →https://doi.org/10.1007/bf01407816openalex-snapshot
A garbage collection algorithm for shared memory parallel processors
inferredcites →https://doi.org/10.1007/bf01414462openalex-snapshot
Global garbage collection for distributed heap storage systems
inferredcites →https://doi.org/10.1007/bf03037204openalex-snapshot
A new external reference management and distributed unification for KL1
inferredcites →https://doi.org/10.1016/0950-5849(91)90086-qopenalex-snapshot
Strand: new concepts in parallel programming
inferredcites →https://doi.org/10.1145/356850.356854openalex-snapshot
Garbage Collection of Linked Data Structures
inferredcites →https://doi.org/10.1145/359460.359470openalex-snapshot
List processing in real time on a serial computer
inferredcites →https://doi.org/10.1145/359576.359583openalex-snapshot
A time- and space-efficient garbage compaction algorithm
inferredcites →https://doi.org/10.1145/800223.806776openalex-snapshot
A relational language for parallel programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.1996.0037openalex-snapshot
Constraint Satisfaction in Distributed Concurrent Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_11openalex-snapshot
Indirect Reference Counting: A Distributed Garbage Collection Algorithm
inferred← citeshttps://doi.org/10.1007/pl00013315openalex-snapshot
A construction of distributed reference counting
inferred← citeshttps://doi.org/10.1145/1108970.1108976openalex-snapshot
Birrell's distributed reference listing revisited
inferred← citeshttps://doi.org/10.1145/185009.185040openalex-snapshot
A bibliography on garbage collection and related topics
inferred← citeshttps://doi.org/10.1145/233561.233565openalex-snapshot
Compositional parallel programming languages
inferred← citeshttps://doi.org/10.1145/286860.286867openalex-snapshot
Hierarchical distributed reference counting
inferred← citeshttps://doi.org/10.1145/289423.289443openalex-snapshot
A distributed garbage collector with diffusion tree reorganisation and mobile objects
inferred← citeshttps://doi.org/10.1145/291251.289443openalex-snapshot
A distributed garbage collector with diffusion tree reorganisation and mobile objects
inferred← citeshttps://doi.org/10.1145/301589.286867openalex-snapshot
Hierarchical distributed reference counting
inferred← citeshttps://doi.org/10.1145/301618.301648openalex-snapshot
On bounding time and space for multiprocessor garbage collection
inferred← citeshttps://doi.org/10.1145/301631.301648openalex-snapshot
On bounding time and space for multiprocessor garbage collection
inferred← citeshttps://doi.org/10.1145/989393.989456openalex-snapshot
On bounding time and space for multiprocessor garbage collection
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.