On the public citation graph
Runtime tags aren't necessary
0 signed · 69 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.1016/0020-0190(87)90175-xopenalex-snapshot
Garbage collection can be faster than stack allocation
inferredcites →https://doi.org/10.1016/0022-0000(78)90014-4openalex-snapshot
A theory of type polymorphism in programming
inferredcites →https://doi.org/10.1016/0141-9331(87)90466-2openalex-snapshot
The design and evaluation of a high performance Smalltalk system
inferredcites →https://doi.org/10.1145/358141.358147openalex-snapshot
A real-time garbage collector based on the lifetimes of objects
inferredcites →https://doi.org/10.1145/989393.989417openalex-snapshot
Real-time concurrent collection on stock multiprocessors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.4380190206openalex-snapshot
Simple generational garbage collection and fast allocation
inferred← citeshttps://doi.org/10.1007/3-540-45306-7_21openalex-snapshot
Constant-Time Root Scanning for Deterministic Garbage Collection
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_12openalex-snapshot
Incremental garbage collection without tags
inferred← citeshttps://doi.org/10.1007/3-540-62852-5_20openalex-snapshot
A type-based implementation of a language with distributed scope
inferred← citeshttps://doi.org/10.1007/3540543961_30openalex-snapshot
Unboxed values as first class citizens in a non-strict functional language
inferred← citeshttps://doi.org/10.1007/3540543961_6openalex-snapshot
GAML: A parallel implementation of lazy ML
inferred← citeshttps://doi.org/10.1007/bfb0017182openalex-snapshot
Uniprocessor garbage collection techniques
inferred← citeshttps://doi.org/10.1007/bfb0017192openalex-snapshot
A conservative garbage collector with ambiguous roots for static typechecking languages
inferred← citeshttps://doi.org/10.1007/bfb0017197openalex-snapshot
Precompiling C++ for garbage collection
inferred← citeshttps://doi.org/10.1007/bfb0017205openalex-snapshot
Allocation regions & implementation contracts
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90021-topenalex-snapshot
A simple code improvement scheme for prolog
inferred← citeshttps://doi.org/10.1016/s0167-2789(96)00319-3openalex-snapshot
Adaptive control of chaotic continuous-time systems with delay
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00108-2openalex-snapshot
A simple approach to supporting untagged objects in dynamically typed languages
inferred← citeshttps://doi.org/10.1017/s0956796821000010openalex-snapshot
Integrating region memory management and tag-free generational garbage collection
inferred← citeshttps://doi.org/10.1023/b:lisp.0000029446.78563.a4openalex-snapshot
A Retrospective on Region-Based Memory Management
inferred← citeshttps://doi.org/10.1109/iwooos.1991.183023openalex-snapshot
Hardware and operating system support for conservative garbage collection
inferred← citeshttps://doi.org/10.1109/tc.2010.13openalex-snapshot
Garbage Collection for Flexible Hard Real-Time Systems
inferred← citeshttps://doi.org/10.1145/1133956.1133974openalex-snapshot
Formal semantics of weak references
inferred← citeshttps://doi.org/10.1145/113445.113460openalex-snapshot
Tag-free garbage collection for strongly typed programming languages
inferred← citeshttps://doi.org/10.1145/113446.113460openalex-snapshot
Tag-free garbage collection for strongly typed programming languages
inferred← citeshttps://doi.org/10.1145/141471.141504openalex-snapshot
Polymorphic type reconstruction for garbage collection without tags
inferred← citeshttps://doi.org/10.1145/141471.141528openalex-snapshot
Proving the correctness of storage representations
inferred← citeshttps://doi.org/10.1145/141478.141504openalex-snapshot
Polymorphic type reconstruction for garbage collection without tags
inferred← citeshttps://doi.org/10.1145/141478.141528openalex-snapshot
Proving the correctness of storage representations
inferred← citeshttps://doi.org/10.1145/143165.143205openalex-snapshot
Unboxed objects and polymorphic typing
inferred← citeshttps://doi.org/10.1145/155332.155340openalex-snapshot
A concurrent copying garbage collector for languages that distinguish (im)mutable data
inferred← citeshttps://doi.org/10.1145/165180.165192openalex-snapshot
Compiler-directed type reconstruction for polymorphic languages
inferred← citeshttps://doi.org/10.1145/173284.155340openalex-snapshot
A concurrent copying garbage collector for languages that distinguish (im)mutable data
inferred← citeshttps://doi.org/10.1145/182409.182411openalex-snapshot
Tag-free garbage collection using explicit type parameters
inferred← citeshttps://doi.org/10.1145/182409.182414openalex-snapshot
Garbage collection for strongly-typed languages using run-time type reconstruction
inferred← citeshttps://doi.org/10.1145/182590.182411openalex-snapshot
Tag-free garbage collection using explicit type parameters
inferred← citeshttps://doi.org/10.1145/182590.182414openalex-snapshot
Garbage collection for strongly-typed languages using run-time type reconstruction
inferred← citeshttps://doi.org/10.1145/224164.224182openalex-snapshot
Abstract models of memory management
inferred← citeshttps://doi.org/10.1145/232627.232635openalex-snapshot
Storage use analysis and its applications
inferred← citeshttps://doi.org/10.1145/2364527.2364569openalex-snapshot
Typing unmarshalling without marshalling types
inferred← citeshttps://doi.org/10.1145/2398856.2364569openalex-snapshot
Typing unmarshalling without marshalling types
inferred← citeshttps://doi.org/10.1145/2636228.2636232openalex-snapshot
An efficient representation for lazy constructors using 64-bit pointers
inferred← citeshttps://doi.org/10.1145/277650.277738openalex-snapshot
Garbage collection and local variable type-precision and liveness in Java virtual machines
inferred← citeshttps://doi.org/10.1145/277652.277738openalex-snapshot
Garbage collection and local variable type-precision and liveness in Java virtual machines
inferred← citeshttps://doi.org/10.1145/3591229openalex-snapshot
Garbage-Collection Safety for Region-Based Type-Polymorphic Programs
inferred← citeshttps://doi.org/10.1145/91556.91564openalex-snapshot
Debugging standard ML without reverse engineering
inferred← citeshttps://doi.org/10.1145/99370.99377openalex-snapshot
Untagged data in tagged environments: choosing optimal representations at compile time
inferred← citeshttps://doi.org/10.1184/r1/6604385openalex-snapshot
Concurrent garbage collection for C++
inferred← citeshttps://doi.org/10.3166/tsi.26.1067-1090openalex-snapshot
Typer la désérialisation sans sérialiser les types
inferred← citeshttps://doi.org/10.4230/lipics.ecoop.2019.25openalex-snapshot
Automatic differentiation in machine learning: a survey
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.