On the public citation graph

A space-and-time-efficient coding algorithm for lattice computations

0 signed · 14 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.1016/0304-3975(86)90047-2openalex-snapshot
An algebraic semantics approach to the effective resolution of type equations
inferredcites →https://doi.org/10.1016/0743-1066(92)90007-popenalex-snapshot
Theory of generalized annotated logic programming and its applications**A preliminary report on this research has appeared in [34].
inferredcites →https://doi.org/10.1145/59287.59293openalex-snapshot
Efficient implementation of lattice operations

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcss.2001.1807openalex-snapshot
Maximizing Sharing of Protected Information
inferred← citeshttps://doi.org/10.1007/3-540-61534-2_18openalex-snapshot
Sparse term encoding for dynamic taxonomies
inferred← citeshttps://doi.org/10.1007/978-3-540-85654-2_68openalex-snapshot
Hierarchy Encoding with Multiple Genes
inferred← citeshttps://doi.org/10.1007/978-3-642-11747-3_4openalex-snapshot
Experiences with PDG-Based IFC
inferred← citeshttps://doi.org/10.1007/s101150200009openalex-snapshot
Efficient Transitive Closure Reasoning in a Combined Class/Part/Containment Hierarchy
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90007-popenalex-snapshot
Theory of generalized annotated logic programming and its applications**A preliminary report on this research has appeared in [34].
inferred← citeshttps://doi.org/10.1016/j.datak.2003.12.001openalex-snapshot
Encoding multiple inheritance hierarchies for lattice operations
inferred← citeshttps://doi.org/10.1023/a:1009969528224openalex-snapshot
The Algebraic Structure of Transitive Closure and its Application to Attributed Type Signatures
inferred← citeshttps://doi.org/10.1109/icccn.2005.1523812openalex-snapshot
Efficient forwarding of symbolically addressed geocast messages
inferred← citeshttps://doi.org/10.1145/303976.303988openalex-snapshot
Minimal data upgrading to prevent inference and association attacks
inferred← citeshttps://doi.org/10.1145/319950.320057openalex-snapshot
Incremental encoding of multiple inheritance hierarchies
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.